Sciweavers

360 search results - page 26 / 72
» Indexing the Distance: An Efficient Method to KNN Processing
Sort
View
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
13 years 11 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 5 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
VLSID
2001
IEEE
164views VLSI» more  VLSID 2001»
14 years 8 months ago
An Efficient Parallel Transparent Bist Method For Multiple Embedded Memory Buffers
In this paper, we propose a new transparent built-in self-test ( TBIST ) method to test multiple embedded memory arrays with various sizes in parallel. First, a new transparent tes...
Der-Cheng Huang, Wen-Ben Jone, Sunil R. Das
ICIP
2010
IEEE
13 years 5 months ago
Fast traumatic brain injury CT slice indexing via anatomical feature classification
Computed tomography (CT) is used widely in traumatic brain injury diagnosis. One axial brain CT scan consists of multiple slices with different heights along the brain axial direc...
Ruizhe Liu, Shimiao Li, Chew Lim Tan, Boon Chuan P...
MOBIDE
2005
ACM
14 years 1 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel