2911 search results - page 456 / 583 » A Logic of Graph Constraints |
118
click to vote
IJCAI
2003
15 years 2 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
103
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
135
Voted
DBSEC
2009
15 years 1 months ago
2009
With the rapid growth in wireless networks and sensor and mobile devices, we are moving towards an era of pervasive computing. Access control is challenging in these environments. ...
106
click to vote
APJOR
2010
15 years 25 days ago
2010
Earth mover's distance (EMD for short) is a perceptually meaningful dissimilarity measure between histograms. The computation of EMD reduces to a network flow optimization pro...
DISOPT
2008
15 years 23 days ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...