Searching for "Searching by Elimination." – sorted by Relevance.
-
Searching to eliminate personal information management
- BY EDWARD CUTRELL, SUSAN T. DUMAIS, AND JAIME TEEVAN Searching to Eliminate Personal Information
- Cited by 15 (1 self) – Add To MetaCart
-
Graph searching, elimination trees, and a generalization of bandwidth
- Graph searching, elimination trees, and a generalization of bandwidth Fedor V. Fomin, Pinar
- Cited by 4 (0 self) – Add To MetaCart
-
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
- REPORTS IN INFORMATICS ISSN 0333-3590 Graph searching, elimination trees, and a generalization
- Add To MetaCart
-
Fast Nearest-Neighbor Search Algorithms Based on Approximation-Elimination Search
- on approximation-elimination search V. Ramasubramanian�, Kuldip K. Paliwal��* �Computer Systems and Communications
- Cited by 5 (0 self) – Add To MetaCart
-
Computationally Scalable Partial Distance Based Fast Search Motion Estimation
- the motion estimation process. The partial distance metric is used within the motion search to eliminate
- Add To MetaCart
-
Application of Range Searching to Fast Financial Risk Estimation
- computational geometry techniques, in particular, range search, to eliminate rows of the matrix to obtain
- Add To MetaCart
-
Mining molecular fragments: Finding relevant substructures of molecules
- faster search by eliminating the need for frequent, computationally expensive reembeddings
- Cited by 51 (7 self) – Add To MetaCart
-
Efficient Path Consistency Algorithms for Constraint Satisfaction Problems
- before or during search, by eliminating inconsistent values from the domains of the corresponding
- Cited by 1 (1 self) – Add To MetaCart
-
A Statistical Model to Correct Systematic Bias Introduced by Algorithmic Thresholds in Protein Structural Comparison Algorithms
- -based searches to eliminate biologically irrelevant matches. Thresholds refine and accelerate the method
- Add To MetaCart
-
Pruning Duplicate Nodes in Depth-First Search
- for reducing the asymptotic complexity of depth-first search by eliminating the generation of duplicate nodes
- Cited by 28 (2 self) – Add To MetaCart

