Sciweavers

4047 search results - page 466 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
INFOVIS
2000
IEEE
15 years 11 months ago
Getting Portals to Behave
Data visualization environments help users understand and analyze their data by permitting interactive browsing of graphical representations of the data. To further facilitate und...
Chris Olston, Allison Woodruff
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
15 years 8 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 8 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
180
Voted
JAIR
2008
130views more  JAIR 2008»
15 years 6 months ago
Axiomatic Foundations for Ranking Systems
Reasoning about agent preferences on a set of alternatives, and the aggregation of such preferences into some social ranking is a fundamental issue in reasoning about multi-agent ...
Alon Altman, Moshe Tennenholtz
BMVC
2010
15 years 4 months ago
Robust Texture Recognition Using Credal Classifiers
Texture classification is used for many vision systems; in this paper we focus on improving the reliability of the classification through the so-called imprecise (or credal) class...
Giorgio Corani, Alessandro Giusti, Davide Migliore...