Sciweavers

4865 search results - page 531 / 973
» The Complexity of Graph Connectivity
Sort
View
ACMACE
2005
ACM
16 years 19 days ago
Gaming on the edge: using seams in ubicomp games
Outdoor multi-player games are an increasingly popular application area for ubiquitous computing, supporting experimentation both with new technologies and new user experiences. T...
Matthew Chalmers, Marek Bell, Barry Brown, Malcolm...
ANTSW
2004
Springer
16 years 14 days ago
How to Use Ants for Hierarchical Clustering
Abstract. We present in this paper, a new model for document hierarchical clustering, which is inspired from the self-assembly behavior of real ants. We have simulated the way ants...
Hanene Azzag, Christiane Guinot, Gilles Venturini
ICRA
2002
IEEE
98views Robotics» more  ICRA 2002»
16 years 1 hour ago
An Efficient Coordination Architecture for Autonomous Robot Teams
Most physically implemented multi-robot controllers are based on extensions of behavior-based systems. While efficient, such techniques suffer from weak representational power. Sy...
Aaron Khoo, Ian Douglas Horswill
ECCV
2010
Springer
15 years 12 months ago
2.5D Dual Contouring: A Robust Approach to Creating Building Models from Aerial LiDAR Point Clouds
We present a robust approach to creating 2.5D building models from aerial LiDAR point clouds. The method is guaranteed to produce crack-free models composed of complex roofs and ve...
Qian-Yi Zhou, Ulrich Neumann
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 11 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...