Results 1  10
of
55,909
ScaleSpace Theory in Computer Vision
, 1994
"... A basic problem when deriving information from measured data, such as images, originates from the fact that objects in the world, and hence image structures, exist as meaningful entities only over certain ranges of scale. "ScaleSpace Theory in Computer Vision" describes a formal theory fo ..."
Abstract

Cited by 625 (21 self)
 Add to MetaCart
A basic problem when deriving information from measured data, such as images, originates from the fact that objects in the world, and hence image structures, exist as meaningful entities only over certain ranges of scale. "ScaleSpace Theory in Computer Vision" describes a formal theory
A theory of shape by space carving
 In Proceedings of the 7th IEEE International Conference on Computer Vision (ICCV99), volume I, pages 307– 314, Los Alamitos, CA
, 1999
"... In this paper we consider the problem of computing the 3D shape of an unknown, arbitrarilyshaped scene from multiple photographs taken at known but arbitrarilydistributed viewpoints. By studying the equivalence class of all 3D shapes that reproduce the input photographs, we prove the existence of a ..."
Abstract

Cited by 566 (14 self)
 Add to MetaCart
of a special member of this class, the photo hull, that (1) can be computed directly from photographs of the scene, and (2) subsumes all other members of this class. We then give a provablycorrect algorithm, called Space Carving, for computing this shape and present experimental results on complex
Pervasive Computing: Vision and Challenges
 IEEE Personal Communications
, 2001
"... This paper discusses the challenges in computer systems research posed by the emerging field of pervasive computing. It first examines the relationship of this new field to its predecessors: distributed systems and mobile computing. It then identifies four new research thrusts: effective use of smar ..."
Abstract

Cited by 686 (22 self)
 Add to MetaCart
of smart spaces, invisibility, localized scalability, and masking uneven conditioning. Next, it sketches a couple of hypothetical pervasive computing scenarios, and uses them to identify key capabilities missing from today's systems. The paper closes with a discussion of the research necessary
Spacetime block codes from orthogonal designs
 IEEE Trans. Inform. Theory
, 1999
"... Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas. ..."
Abstract

Cited by 1524 (42 self)
 Add to MetaCart
Abstract — We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into � streams which are simultaneously transmitted using � transmit antennas
Scheduling Multithreaded Computations by Work Stealing
, 1994
"... This paper studies the problem of efficiently scheduling fully strict (i.e., wellstructured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind of dynamic MIMDstyle computation is “work stealing," in which processors needing work steal com ..."
Abstract

Cited by 568 (34 self)
 Add to MetaCart
is Tp = O(TI/P + Tm), where TI is the minimum serial ezecution time of the multithreaded computation and T, is the minimum ezecution time with an infinite number of processors. Moreover, the space Sp required by the execution satisfies Sp 5 SIP. We also show that the ezpected total communication
Space/Time Tradeoffs in Hash Coding with Allowable Errors
 Communications of the ACM
, 1970
"... this paper tradeoffs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages onebyone for membership in a given set of messages. Two new hash coding methods are examined and compared with a particular conventional h ..."
Abstract

Cited by 2097 (0 self)
 Add to MetaCart
hashcoding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency
Surface deformation due to shear and tensile faults in a halfspace
, 1985
"... A complete set of closed analytical expressions is presented in a unified manner for the internal displacements and strains due to shear and tensile faults in a halfspace for both point and finite rectangular sources. These expressions are particularly compact and systematically composed of terms r ..."
Abstract

Cited by 727 (1 self)
 Add to MetaCart
A complete set of closed analytical expressions is presented in a unified manner for the internal displacements and strains due to shear and tensile faults in a halfspace for both point and finite rectangular sources. These expressions are particularly compact and systematically composed of terms
Mean shift: A robust approach toward feature space analysis
 In PAMI
, 2002
"... A general nonparametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational module of the technique is an old pattern recognition procedure, the mean shift. We prove for discrete data the convergence ..."
Abstract

Cited by 2395 (37 self)
 Add to MetaCart
A general nonparametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational module of the technique is an old pattern recognition procedure, the mean shift. We prove for discrete data
Mtree: An Efficient Access Method for Similarity Search in Metric Spaces
, 1997
"... A new access meth d, called Mtree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract

Cited by 663 (38 self)
 Add to MetaCart
are reported, considering as th performance criteria th number of page I/O's and th number of distance computations. Th results demonstratethm th Mtree indeed extendsth domain of applicability beyond th traditional vector spaces, performs reasonably well inhE[94Kv#E44V[vh data spaces, and scales well
Probabilistic Roadmaps for Path Planning in HighDimensional Configuration Spaces
 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION
, 1996
"... A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collisionfree configurations and whose edg ..."
Abstract

Cited by 1277 (120 self)
 Add to MetaCart
edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two
Results 1  10
of
55,909