311 results about "Breadth-first search" patented technology

A personalized ratee reputation of a first entity from the perspective of a second entity is determined. The second entity is connected by one or more rating paths to the first entity. A breadth-first search is performed, beginning at the second entity, to determine, from the one or more rating paths, one or more first rating paths that have a first length equal to a shortest length between the first entity and the second entity. For each determined first rating path, a third entity on the first rating path that has a level equal to one less than the first length is identified. For each identified third entity, a first rating of the first entity provided by the third entity determined, and the first ratings are combined. The personalized ratee reputation is then produced by weighting the combined first ratings by an amount according to the first length.

A method and apparatus for encoding and / or decoding depth image-based representation (DIBR) data are provided. The encoding method includes: converting 3-dimensional (3D) volume data into adjustable octree data with predetermined labels given to nodes; by referring to the labels, encoding nodes of the adjustable octree from the root node to leaf nodes by a modified breadth-first search (BFS) method allocating priorities among children nodes; and generating a bitstream with predetermined header information and encoded node data. The decoding method includes: extracting header information containing at least resolution information of an object, from a bitstream and decoding the header information; calculating the number of nodes by using the resolution information of the header, and by a modified BFS method allocating priorities among children nodes, decoding each node of a tree from the root node to leaf nodes; and restoring an adjustable tree by using decoded nodes. According to the method and apparatus, a huge amount of 3D volume data can be encoded with a high efficiency, and volume data with an arbitrary resolution as well as volume data with a fixed resolution can be encoded with a high efficiency. Accordingly, with a small amount of data, 3D volume data with a high picture quality can be restored. In addition, since a progressive bitstream is generated, 3D volume data can be shown progressively when decoding is performed.

Techniques are provided for discovery and monitoring of an environment using a plurality of robots. A plurality of robots navigate an environment by determining a navigation buffer for each of the robots; and allowing each of the robots to navigate within the environment while maintaining a substantially minimum distance from other robots, wherein the substantially minimum distance corresponds to the navigation buffer, and wherein a size of each of the navigation buffers is reduced over time based on a percentage of the environment that remains to be navigated. The robots can also navigate an environment by obtaining a discretization of the environment to a plurality of discrete regions; and determining a next unvisited discrete region for one of the plurality of robots to explore in the exemplary environment using a breadth-first search. The plurality of discrete regions can be, for example, a plurality of real or virtual tiles.