276 search results - page 36 / 56 » The Complexity of Computing Maximal Word Functions |
114
click to vote
CVIU
2008
14 years 11 months ago
2008
This paper presents a search engine architecture, RETIN, aiming at retrieving complex categories in large image databases. For indexing, a scheme based on a two-step quantization ...
SIAMCOMP
2000
14 years 11 months ago
2000
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
FOCS
1994
IEEE
15 years 3 months ago
1994
IEEE
We establish a nonlinear lower bound for halfplane range searching over a group. Specifically, we show that summing up the weights of n (weighted) points within n halfplanes requir...
TCS
1998
14 years 11 months ago
1998
![Threshold Dominating Sets and an Improved Characterization of W[2]](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/threshold_dominating_sets_and_an_improved_characterization_of_w_2_TCS_1998.jpg "Threshold Dominating Sets and an Improved Characterization of W[2]")
The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...
108
click to vote
ICCV
2007
IEEE
15 years 3 months ago
2007
IEEE
We present a Diffusion Maps clustering method applied to diffusion MRI in order to segment complex white matter fiber bundles. It is well-known that diffusion tensor imaging (DTI)...