9842 search results - page 1653 / 1969 » The Complexity of the Matching-Cut Problem |
150
click to vote
ICCBR
2003
Springer
15 years 10 months ago
2003
Springer
CBR applications running in real domains can easily reach thousands of cases, which are stored in the case library. Retrieval times can increase greatly if the retrieval algorithm ...
152
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
171
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
120
click to vote
HICSS
2002
IEEE
15 years 9 months ago
2002
IEEE
In this paper the problem of developing bidding strategies for the participants of dynamic energy-multi markets is studied. Attention is given to strategic bidding of load serving...
153
Voted
ICPP
2002
IEEE
15 years 9 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...