Sciweavers

3136 search results - page 5 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
PKDD
2007
Springer
107views Data Mining» more  PKDD 2007»
14 years 5 months ago
An Empirical Comparison of Exact Nearest Neighbour Algorithms
Nearest neighbour search (NNS) is an old problem that is of practical importance in a number of fields. It involves finding, for a given point q, called the query, one or more po...
Ashraf M. Kibriya, Eibe Frank
NDSS
2006
IEEE
14 years 4 months ago
Toward a Practical Data Privacy Scheme for a Distributed Implementation of the Smith-Waterman Genome Sequence Comparison Algorit
Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The resulting platforms provide computational power pre...
Doug Szajda, Michael Pohl, Jason Owen, Barry G. La...
MSWIM
2004
ACM
14 years 4 months ago
Outdoor experimental comparison of four ad hoc routing algorithms
Most comparisons of wireless ad hoc routing algorithms involve simulated or indoor trial runs, or outdoor runs with only a small number of nodes, potentially leading to an incorre...
Robert S. Gray, David Kotz, Calvin C. Newport, Nik...
VTC
2006
IEEE
159views Communications» more  VTC 2006»
14 years 4 months ago
Comparison between Vertical Handoff Decision Algorithms for Heterogeneous Wireless Networks
— The next generation wireless networks will support the vertical handoff mechanism in which users can maintain the connections when they switch from one network to another (e.g....
Enrique Stevens-Navarro, Vincent W. S. Wong
ACIVS
2006
Springer
14 years 4 months ago
A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...