1327 search results - page 206 / 266 » Path following algorithm for the graph matching problem |
128
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
139
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
131
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
117
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
274
click to vote
INFOCOM
2005
IEEE
15 years 7 months ago
2005
IEEE
Abstract— We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix,...