Sciweavers

2969 search results - page 438 / 594
» A space efficient algorithm for group structure computation
Sort
View
GRC
2008
IEEE
15 years 7 months ago
Neighborhood Smoothing Embedding for Noisy Manifold Learning
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
Guisheng Chen, Junsong Yin, Deyi Li
POPL
2007
ACM
16 years 6 months ago
Cork: dynamic memory leak detection for garbage-collected languages
A memory leak in a garbage-collected program occurs when the program inadvertently maintains references to objects that it no longer needs. Memory leaks cause systematic heap grow...
Maria Jump, Kathryn S. McKinley
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 6 months ago
Succinct Geometric Indexes Supporting Point Location Queries
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
Prosenjit Bose, Eric Y. Chen, Meng He, Anil Mahesh...
WWW
2011
ACM
15 years 1 months ago
Pragmatic evaluation of folksonomies
Recently, a number of algorithms have been proposed to obtain hierarchical structures — so-called folksonomies — from social tagging data. Work on these algorithms is in part ...
Denis Helic, Markus Strohmaier, Christoph Trattner...
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 12 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler