Sciweavers

1029 search results - page 88 / 206
» Compact representations of ordered sets
Sort
View
ICASSP
2011
IEEE
14 years 6 months ago
Outlier-aware robust clustering
Clustering is a basic task in a variety of machine learning applications. Partitioning a set of input vectors into compact, wellseparated subsets can be severely affected by the p...
Pedro A. Forero, Vassilis Kekatos, Georgios B. Gia...
PPDP
2009
Springer
15 years 9 months ago
An embedded declarative data transformation language
We introduce a logic programming framework for data type transformations based on isomorphisms between elementary data types (natural numbers, finite functions, sets and permutat...
Paul Tarau
92
Voted
WSC
2004
15 years 4 months ago
Developing Federation Object Models Using Ontologies
The reuse of existing simulations in multiple federations is an important goal of distributed simulation frameworks. However, in order to reuse a federate, its simulation code oft...
Tarun Rathnam, Christiaan J. J. Paredis
111
Voted
IV
2008
IEEE
155views Visualization» more  IV 2008»
15 years 9 months ago
Visualise Undrawable Euler Diagrams
Given a group of overlapping sets, it is not always possible to represent it with Euler diagrams. Euler diagram characteristics might collide with the sets relationships to depict...
Paolo Simonetto, David Auber
131
Voted
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
15 years 8 months ago
Thoughts on solution concepts
This paper explores connections between Ficici’s notion of solution concept and order theory. Ficici postulates that algorithms should ascend an order called weak preference; th...
Anthony Bucci, Jordan B. Pollack