169 search results - page 26 / 34 » Distributed Approximation Algorithms for Finding 2-Edge-Conn... |
KDD
2008
ACM
14 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 ...
DCOSS
2008
Springer
13 years 9 months ago
2008
Springer
When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match...
JMLR
2010
13 years 2 months ago
2010
We consider the problem of reducing the dimensionality of labeled data for classification. Unfortunately, the optimal approach of finding the low-dimensional projection with minim...
UAI
2004
13 years 8 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...