Sciweavers

10988 search results - page 471 / 2198
» Algorithmic Folding Complexity
Sort
View
IPPS
1997
IEEE
15 years 10 months ago
Designing Efficient Distributed Algorithms Using Sampling Techniques
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...
Sanguthevar Rajasekaran, David S. L. Wei
CORR
2000
Springer
116views Education» more  CORR 2000»
15 years 6 months ago
Algorithmic Statistics
While Kolmogorov complexity is the accepted absolute measure of information content of an individual finite object, a similarly absolute notion is needed for the relation between a...
Péter Gács, John Tromp, Paul M. B. V...
GIS
2009
ACM
15 years 11 months ago
Data structures and intersection algorithms for 3D spatial data types
Apart from visualization tasks, three-dimensional (3D) data management features are not or only hardly available in current spatial database systems and Geographic Information Sys...
Tao Chen, Markus Schneider
ISER
1993
Springer
123views Robotics» more  ISER 1993»
15 years 10 months ago
Mobile Robot Miniaturisation: A Tool for Investigation in Control Algorithms
The interaction of an autonomous mobile robot with the real world critically depends on the robots morphology and on its environment. Building a model of these aspects is extremel...
Francesco Mondada, Edoardo Franzi, Paolo Ienne
ECCV
2006
Springer
16 years 8 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother