683 search results - page 61 / 137 » Randomized Data Structures for the Dynamic Closest-Pair Prob... |
3DPVT
2006
IEEE
13 years 10 months ago
2006
IEEE
3D scanning techniques based on structured light usually achieve robustness against outliers by performing multiple projections to simplify correspondence. However, for cases such...
IADIS
2003
13 years 9 months ago
2003
The problem of hypertext classification deals with objects possessing more complex information structure than the plain text has. Present hypertext classification systems show the...
DAWAK
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
SIAMCOMP
1998
13 years 7 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...