9842 search results - page 361 / 1969 » The Complexity of the Matching-Cut Problem |
128
Voted
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
144
click to vote
ECBS
2006
IEEE
15 years 10 months ago
2006
IEEE
Complex and distributed systems are more and more common. Hardware is going from strength to strength and is embedded in high performance peer-to-peer networks mostly. The task of...
149
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
121
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
In this paper, we propose an effective algorithm flow to handle largescale mixed-size placement. The basic idea is to use floorplanning to guide the placement of objects at the gl...
230
click to vote
ICDT
2009
ACM
16 years 4 months ago
2009
ACM
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...