1272 search results - page 205 / 255 » Approximate Parameterized Matching |
142
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
134
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
138
Voted
CIVR
2007
Springer
15 years 9 months ago
2007
Springer
This paper proposes and compares two novel schemes for near duplicate image and video-shot detection. The first approach is based on global hierarchical colour histograms, using ...
178
click to vote
VLDB
1999
ACM
15 years 7 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
164
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
Accurate system planning and performance evaluation requires knowledge of the joint impact of scheduling, interference, and fading. However, current analyses either require costly...