962 search results - page 92 / 193 » Efficient Algorithms for Eulerian Extension |
164
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
154
click to vote
ICSE
2004
IEEE-ACM
16 years 4 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
133
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
The use of network coding has been shown to improve throughput in input-queued multicast switches, but not without costs of computational complexity and delays. In this paper, we i...
221
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
Many semi-supervised learning algorithms only
deal with binary classification. Their extension to the
multi-class problem is usually obtained by repeatedly
solving a set of bina...
215
click to vote
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
We present a system that enables flexible and efficient phrase matching in XML documents. Since XML allows structured and unstructured information to be interleaved, phrase matchi...