2342 search results - page 316 / 469 » Sublinear geometric algorithms |
152
click to vote
WSNA
2003
ACM
15 years 8 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
122
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
146
Voted
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of...
136
click to vote
MCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
114
click to vote
RT
2001
Springer
15 years 7 months ago
2001
Springer
This paper describes a novel from-region visibility algorithm, the unique properties of which allow conducting remote walkthroughs in very large virtual environments, without prepr...