Sciweavers

1117 search results - page 146 / 224
» Equivalent Representations of Set Functions
Sort
View
CORR
2010
Springer
198views Education» more  CORR 2010»
14 years 6 months ago
Convex Graph Invariants
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
Venkat Chandrasekaran, Pablo A. Parrilo, Alan S. W...
VISUALIZATION
1996
IEEE
15 years 2 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
15 years 10 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
TABLEAUX
2009
Springer
15 years 4 months ago
Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus
We study the logic of comparative concept similarity CSL introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison. In thi...
Régis Alenda, Nicola Olivetti, Camilla Schw...
ICMCS
2005
IEEE
106views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Media Aware Routing in Large Scale Networks with Overlay
This paper presents a new routing strategy, that selects the best network paths in an overlay network, in order to minimize the distortion perceived by the end user. We first pro...
Dan Jurca, Sanja Petrovic, Pascal Frossard