Sciweavers

150 search results - page 28 / 30
» Traversing a set of points with a minimum number of turns
Sort
View
PRESENCE
2006
102views more  PRESENCE 2006»
13 years 5 months ago
The Usability of Collaborative Virtual Environments and Methods for the Analysis of Interaction
This paper describes two methods for analyzing interactions in collaborative virtual environments (CVEs): one whereby quantitative data are captured, interaction is categorized in...
Ralph Schroeder, Ilona Heldal, Jolanda G. Tromp
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
13 years 10 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 5 months ago
Robust information-theoretic clustering
How do we find a natural clustering of a real world point set, which contains an unknown number of clusters with different shapes, and which may be contaminated by noise? Most clu...
Christian Böhm, Christos Faloutsos, Claudia P...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
13 years 12 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
IPPS
2008
IEEE
13 years 11 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...