Sciweavers

172 search results - page 10 / 35
» On the cost of searching signature trees
Sort
View
IBPRIA
2007
Springer
14 years 1 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...
FOCS
1989
IEEE
13 years 11 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
ANOR
2002
128views more  ANOR 2002»
13 years 7 months ago
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search
The Airline Crew Assignment Problem (ACA) consists of assigning lines of work to a set of crew members such that a set of activities is partitioned and the costs for that assignmen...
Meinolf Sellmann, Kyriakos Zervoudakis, Panagiotis...
ICANN
2007
Springer
13 years 11 months ago
An Efficient Search Strategy for Feature Selection Using Chow-Liu Trees
Within the taxonomy of feature extraction methods, recently the Wrapper approaches lost some popularity due to the associated computational burden, compared to Embedded or Filter m...
Erik Schaffernicht, Volker Stephan, Horst-Michael ...
TCOM
2010
112views more  TCOM 2010»
13 years 5 months ago
On further reduction of complexity in tree pruning based sphere search
Abstract—In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational compl...
Byonghyo Shim, Insung Kang