1091 search results - page 108 / 219 » Approximation in Databases |
184
Voted
KDD
2008
ACM
16 years 6 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
185
click to vote
KDD
2000
ACM
15 years 9 months ago
2000
ACM
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
140
click to vote
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Advances in object detection have made it possible to
collect large databases of certain objects. In this paper we
exploit these datasets for within-object classification. For
e...
261
click to vote
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the exist...
262
click to vote
ICDE
2006
IEEE
16 years 7 months ago
2006
IEEE
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...