559 search results - page 96 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
ICML
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper, we present an information-theoretic approach to learning a Mahalanobis distance function. We formulate the problem as that of minimizing the differential relative e...
WISEC
2009
ACM
14 years 3 months ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
ICDE
2009
IEEE
14 years 3 months ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...
TMC
2010
13 years 3 months ago
2010
A data mule represents a mobile device that collects data in a sensor field by physically visiting the nodes in a sensor network. The data mule collects data when it is in the prox...
PODS
2007
ACM
14 years 8 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...