Results 1 - 10 of 10,843

M-tree: An Efficient Access Method for Similarity Search in Metric Spaces

by Paolo Ciaccia, Marco Patella, Pavel Zezula , 1997
"... A new access meth d, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion o ..."
Abstract - Cited by 663 (38 self) - Add to MetaCart
A new access meth d, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. whE4 object proximity is only defined by a distance function satisfyingth positivity, symmetry, and triangle inequality postulates. We detail algorith[ for insertion

Gapped BLAST and PSI-BLAST: a new generation of protein database search programs.

by Stephen F Altschul , Thomas L Madden , Alejandro A Schäffer , Jinghui Zhang , Zheng Zhang , Webb Miller , David J Lipman - Nucleic Acids Res. , 1997
"... ABSTRACT The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased substantia ..."
Abstract - Cited by 8572 (88 self) - Add to MetaCart
ABSTRACT The BLAST programs are widely used tools for searching protein and DNA databases for sequence similarities. For protein comparisons, a variety of definitional, algorithmic and statistical refinements described here permits the execution time of the BLAST programs to be decreased

Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections

by Douglass R. Cutting, David R. Karger, Jan O. Pedersen, John W. Tukey , 1992
"... Document clustering has not been well received as an information retrieval tool. Objections to its use fall into two main categories: first, that clustering is too slow for large corpora (with running time often quadratic in the number of documents); and second, that clustering does not appreciably ..."
Abstract - Cited by 777 (12 self) - Add to MetaCart
improve retrieval. We argue that these problems arise only when clustering is used in an attempt to improve conventional search techniques. However, looking at clustering as an information access tool in its own right obviates these objections, and provides a powerful new access paradigm. We present a

Dropout from higher education: A theoretical synthesis of recent research

by Vincent Tinto - Review of Educational Research , 1975
"... Despite the very extensive literature on dropout from higher education, much remains unknown about the nature of the dropout process. In large measure, the failure of past research to delineate more clearly the multiple characteristics of dropout can be traced to two major shortcomings; namely, inad ..."
Abstract - Cited by 798 (2 self) - Add to MetaCart
. Nor is it uncommon to find permanent dropouts placed together with persons whose leaving may be temporary in I am indebted to my research assistant, John B. Cullen, for having made an extensive literature search and compiling summaries of the literature for me. I am also indebted to Professors Peter

Self-adjusting binary search trees

by Daniel Dominic Sleator, Robert Endre Tarjan , 1985
"... The splay tree, a self-adjusting form of binary search tree, is developed and analyzed. The binary search tree is a data structure for representing tables and lists so that accessing, inserting, and deleting items is easy. On an n-node splay tree, all the standard search tree operations have an am ..."
Abstract - Cited by 432 (18 self) - Add to MetaCart
. Extensions of splaying give simplified forms of two other data structures: lexicographic or multidimensional search trees and link/ cut trees.

Planning as heuristic search,

by Blai Bonet , Héctor Geffner - 5 – 33, ISSN , 2001
"... Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with state-of-the-art Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics ..."
Abstract - Cited by 421 (33 self) - Add to MetaCart
then consider variations and extensions such as reversing the direction of the search for speeding node evaluation, and extracting information about propositional invariants for avoiding dead-ends. We analyze the resulting planners, evaluate their performance, and explain when they do best. We also compare

EngagingMedical Librarians to Improve the Quality of Review Articles

by unknown authors
"... Review articles published in JAMA summarize various aspectsofmedicalpracticeandarewrittenbyknownau-thorities.Anexpert’sopinionabouta topichasvalue,but often more can be learned by that expert’s assessment ofall thepertinent literature.Whenreading individual re-search articles, readers couldmiss subt ..."
Abstract - Add to MetaCart
. To minimize this potential for bias, JAMA editors ask au-thors to systematically review the literature and com-ment on as much of it as is practical. Extensive litera-ture searches can be difficult to perform, given the

Enhanced hypertext categorization using hyperlinks

by Soumen Chakrabarti, Byron Dom, Piotr Indyk , 1998
"... A major challenge in indexing unstructured hypertext databases is to automatically extract meta-data that enables structured search using topic taxonomies, circumvents keyword ambiguity, and improves the quality of search and profile-based routing and filtering. Therefore, an accurate classifier is ..."
Abstract - Cited by 453 (8 self) - Add to MetaCart
is an essential component of a hypertext database. Hyperlinks pose new problems not addressed in the extensive text classification literature. Links clearly contain high-quality semantic clues that are lost upon a purely term-based classifier, but exploiting link information is non-trivial because it is noisy

METHODOLOGY Development of a disease-specific health-related quality of life questionnaire for patients with post-stroke spasticity

by Yanhong Zhang, Baoyan Liu, Zhishun Liu, Yin Wang, Hong Zhao, Mingjie Zi, Liping Wang, Hong Liu, Zhen Chen, Ying Xie, Zhishun Liu, Yin Wang, Hong Zhao, Liping Wang, Hong Liu, Huguosi Hospital, Beijing Universi , 2012
"... OBJECTIVE: This study was designed to develop a disease-specific health-related quality of life (HR-QOL) measure for patients with post-stroke spasticity. METHODS: Based on responses from 20 patients with post-stroke spasticity and an extensive litera-ture search, items potentially used to measure t ..."
Abstract - Add to MetaCart
OBJECTIVE: This study was designed to develop a disease-specific health-related quality of life (HR-QOL) measure for patients with post-stroke spasticity. METHODS: Based on responses from 20 patients with post-stroke spasticity and an extensive litera-ture search, items potentially used to measure

The Dynamic Window Approach to Collision Avoidance

by Dieter Fox , Wolfram Burgard, Sebastian Thrun
"... This paper describes the dynamic window approach to reactive collision avoidance for mobile robots equipped with synchro-drives. The approach is derived directly from the motion dynamics of the robot and is therefore particularly well-suited for robots operating at high speed. It differs from previo ..."
Abstract - Cited by 433 (32 self) - Add to MetaCart
previous approaches in that the search for commands controlling the translational and rotational velocity of the robot is carried out directly in the space of velocities. The advantage of our approach is that it correctly and in an elegantway incorporates the dynamics of the robot. This is done by reducing
Results 1 - 10 of 10,843