Sciweavers

8437 search results - page 455 / 1688
» Preferences over Sets
Sort
View
SARA
2005
Springer
16 years 11 days ago
The Cruncher: Automatic Concept Formation Using Minimum Description Length
Abstract. We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attrib...
Marc Pickett, Tim Oates
COMPGEOM
2004
ACM
16 years 9 days ago
Time-varying reeb graphs for continuous space-time data
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
Herbert Edelsbrunner, John Harer, Ajith Mascarenha...
SWAT
2000
Springer
107views Algorithms» more  SWAT 2000»
15 years 10 months ago
A New Trade-Off for Deterministic Dictionaries
We consider dictionaries over the universe U = {0, 1}w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with m...
Rasmus Pagh
ICPR
2010
IEEE
15 years 9 months ago
Learning Probabilistic Models of Contours
We present a methodology for learning spline-based probabilistic models for sets of contours, proposing a new Monte Carlo variant of the EM algorithm to estimate the parameters of...
Laure Amate, Maria João Rendas
ECAI
2008
Springer
15 years 8 months ago
XTT+ Rule Design Using the ALSV(FD)
This paper presents advances in Set Attributive Logic and its application to develop tabular rule-based systems within the XTT framework. The primary goal is to extend the expressi...
Grzegorz J. Nalepa, Antoni Ligeza