Sciweavers

1395 search results - page 244 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
PREMI
2005
Springer
14 years 2 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
COMPGEOM
2010
ACM
14 years 1 months ago
Computing similarity between piecewise-linear functions
We study the problem of computing the similarity between two piecewise-linear bivariate functions defined over a common domain, where the surfaces they define in 3D—polyhedral...
Pankaj K. Agarwal, Boris Aronov, Marc J. van Kreve...
CPM
1993
Springer
154views Combinatorics» more  CPM 1993»
14 years 18 days ago
On Suboptimal Alignments of Biological Sequences
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re ect the correct biolog...
Dalit Naor, Douglas L. Brutlag
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
BMCBI
2007
142views more  BMCBI 2007»
13 years 8 months ago
LinkHub: a Semantic Web system that facilitates cross-database queries and information retrieval in proteomics
nd: A key abstraction in representing proteomics knowledge is the notion of unique identifiers for individual entities (e.g. proteins) and the massive graph of relationships among...
Andrew K. Smith, Kei-Hoi Cheung, Kevin Y. Yip, Mar...