Sciweavers

39 search results - page 7 / 8
» On a Logical Approach to Estimating Computational Complexity...
Sort
View
COMPGEOM
2011
ACM
12 years 9 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
BMCBI
2007
144views more  BMCBI 2007»
13 years 5 months ago
Accelerated search for biomolecular network models to interpret high-throughput experimental data
Background: The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein e...
Suman Datta, Bahrad A. Sokhansanj
ICCSA
2007
Springer
13 years 7 months ago
Improving the Customization of Natural Language Interface to Databases Using an Ontology
Natural language interfaces to databases are considered one of the best alternatives for final users who wish to make complex, uncommon and frequent queries, which is a very common...
M. Jose A. Zarate, Rodolfo A. Pazos, Alexander F. ...
IJCAI
1989
13 years 7 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine
CGF
2011
12 years 9 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...