3600 search results - page 568 / 720 » The settling-time reducibility ordering |
188
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
139
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
—Video-on-Demand (VoD) services have attracted a lot of attentions in recent years. Measurement studies show that VCR (Video Cassette Recorder) operations, such as pause, rewind,...
183
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
191
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
181
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...