6274 search results - page 1092 / 1255 » From query complexity to computational complexity |
157
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Recognizing texts from camera images is a known hard problem because of the difficulties in text segmentation from the varied and complicated backgrounds. In this paper, we propo...
148
click to vote
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
148
click to vote
COMPGEOM
2006
ACM
15 years 11 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
176
click to vote
IUI
2004
ACM
15 years 10 months ago
2004
ACM
Complex applications in many areas, including scientific computations and business-related web services, are created from collections of components to form workflows. In many case...
132
Voted
COCO
2004
Springer
15 years 10 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....