2446 search results - page 170 / 490 » Choiceless Polynomial Time |
147
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
166
Voted
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
154
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
141
click to vote
ISCAS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
127
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...