Sciweavers

820 search results - page 6 / 164
» Finding low-utility data structures
Sort
View
ECOOP
2012
Springer
11 years 11 months ago
Static Detection of Loop-Invariant Data Structures
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...
Guoqing (Harry) Xu, Dacong Yan, Atanas Rountev
ICALP
2005
Springer
14 years 2 months ago
Union-Find with Constant Time Deletions
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
Stephen Alstrup, Inge Li Gørtz, Theis Rauhe...
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 10 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang
AAAI
2007
13 years 11 months ago
Manifold Denoising as Preprocessing for Finding Natural Representations of Data
A natural representation of data is given by the parameters which generated the data. If the space of parameters is continuous, then we can regard it as a manifold. In practice, w...
Matthias Hein, Markus Maier
MCS
2001
Springer
14 years 1 months ago
Finding Consistent Clusters in Data Partitions
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...
Ana L. N. Fred