Sciweavers

711 search results - page 108 / 143
» Matching Hierarchical Structures Using Association Graphs
Sort
View
DEBU
2010
108views more  DEBU 2010»
15 years 2 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava
118
Voted
AAAI
2006
15 years 3 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
CGF
2008
151views more  CGF 2008»
15 years 1 months ago
Navigation and Exploration of Interconnected Pathways
Visualizing pathways, i. e. models of cellular functional networks, is a challenging task in computer assisted biomedicine. Pathways are represented as large collections of interw...
Marc Streit, Michael Kalkusch, Karl Kashofer, Diet...
139
Voted
BMCBI
2007
134views more  BMCBI 2007»
15 years 2 months ago
Automatic generation of 3D motifs for classification of protein binding sites
Background: Since many of the new protein structures delivered by high-throughput processes do not have any known function, there is a need for structure-based prediction of prote...
Jean-Christophe Nebel, Pawel Herzyk, David R. Gilb...
NIPS
1990
15 years 3 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro