Sciweavers

234 search results - page 21 / 47
» Rough Set Approximations in Formal Concept Analysis
Sort
View
ICCS
2005
Springer
14 years 1 months ago
Querying a Bioinformatic Data Sources Registry with Concept Lattices
Abstract Bioinformatic data sources available on the web are multiple and heterogenous. The lack of documentation and the difficulty of interaction with these data banks require us...
Nizar Messai, Marie-Dominique Devignes, Amedeo Nap...
COMPGEOM
2011
ACM
12 years 11 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,...
SAS
2001
Springer
14 years 4 days ago
Solving Regular Tree Grammar Based Constraints
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
Yanhong A. Liu, Ning Li, Scott D. Stoller
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 7 months ago
Does intelligence imply contradiction?
Contradiction is often seen as a defect of intelligent systems and a dangerous limitation on efficiency. In this paper we raise the question of whether, on the contrary, it could ...
Patrizio Frosini
JMLR
2006
150views more  JMLR 2006»
13 years 7 months ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...