Sciweavers

6274 search results - page 43 / 1255
» From query complexity to computational complexity
Sort
View
JPDC
2007
138views more  JPDC 2007»
13 years 9 months ago
Distributed computation of the knn graph for large high-dimensional point sets
High-dimensional problems arising from robot motion planning, biology, data mining, and geographic information systems often require the computation of k nearest neighbor (knn) gr...
Erion Plaku, Lydia E. Kavraki
CIE
2006
Springer
14 years 1 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
ICPR
2002
IEEE
14 years 11 months ago
Hierarchical Monitoring of People's Behaviors in Complex Environments Using Multiple Cameras
We present a distributed, surveillance system that works in large and complex indoor environments. To track and recognize behaviors of people, we propose the use of the Hidden Mar...
Nam Thanh Nguyen, Svetha Venkatesh, Geoff A. W. We...
VRST
2004
ACM
14 years 3 months ago
Interactive collision detection for complex and deformable models using programmable graphics hardware
In this paper we present an interactive collision detection algorithm for complex and deformable objects. For two target models, our approach rapidly calculates their region of in...
Wei Chen, Huagen Wan, Hongxin Zhang, Hujun Bao, Qu...
JSC
2007
84views more  JSC 2007»
13 years 9 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger