Sciweavers

87 search results - page 10 / 18
» Efficient Multidimensional Searching Routines
Sort
View
NETWORKS
2006
13 years 7 months ago
Black hole search in common interconnection networks
Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that de...
Stefan Dobrev, Paola Flocchini, Rastislav Kralovic...
ICCV
2009
IEEE
13 years 5 months ago
Tracking a large number of objects from multiple views
We propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. We formulate the problem of finding co...
Zheng Wu, Nickolay I. Hristov, Tyson L. Hedrick, T...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
13 years 11 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
BMCBI
2008
211views more  BMCBI 2008»
13 years 7 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
ICDE
2007
IEEE
185views Database» more  ICDE 2007»
14 years 9 months ago
On k-Nearest Neighbor Searching in Non-Ordered Discrete Data Spaces
A k-nearest neighbor (k-NN) query retrieves k objects from a database that are considered to be the closest to a given query point. Numerous techniques have been proposed in the p...
Dashiell Kolbe, Qiang Zhu, Sakti Pramanik