4761 search results - page 291 / 953 » Generalizing Boundary Points |
203
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
137
click to vote
PR
2007
15 years 5 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
163
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
155
Voted
CAIP
2007
Springer
16 years 7 days ago
2007
Springer
An algorithm of estimation of the curvature at each point of a general discrete curve in O(nlog2 n) is proposed. It uses the notion of blurred segment, extending the definition of...
159
click to vote
DCG
2006
15 years 6 months ago
2006
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...