820 search results - page 59 / 164 » Finding low-utility data structures |
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...
133
click to vote
SIGMOD
2007
ACM
15 years 10 months ago
2007
ACM
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
ASUNAM
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--As research into community finding in social networks progresses, there is a need for algorithms capable of detecting overlapping community structure. Many algorithms hav...
ICSE
1997
IEEE-ACM
15 years 1 months ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...