5785 search results - page 679 / 1157 » Approximability of Probability Distributions |
279
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
ImageNet is a large-scale database of object classes with millions of images. Unfortunately only a small fraction of them is manually annotated with bounding-boxes. This prevents ...
198
click to vote
KDD
2008
ACM
16 years 7 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 ...
205
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
185
Voted
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
182
Voted
SIGMOD
2004
ACM
16 years 7 months ago
2004
ACM
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...