Sciweavers

1403 search results - page 47 / 281
» Set cover algorithms for very large datasets
Sort
View
DKE
2002
107views more  DKE 2002»
14 years 9 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
AAAI
2008
15 years 1 days ago
A Computational Analysis of the Tournament Equilibrium Set
A recurring theme in AI and multiagent systems is how to select the "most desirable" elements given a binary dominance relation on a set of alternatives. Schwartz's...
Felix Brandt, Felix A. Fischer, Paul Harrenstein, ...
INFOVIS
2002
IEEE
15 years 2 months ago
Case Study: Visualizing Sets of Evolutionary Trees
We describe a visualization tool which allows a biologist to explore a large set of hypothetical evolutionary trees. Interacting with such a dataset allows the biologist to identi...
Nina Amenta, Jeff Klingner
65
Voted
NIPS
2007
14 years 11 months ago
Estimating disparity with confidence from energy neurons
The peak location in a population of phase-tuned neurons has been shown to be a more reliable estimator for disparity than the peak location in a population of position-tuned neur...
Eric K. C. Tsang, Bertram Emil Shi
COLT
2004
Springer
15 years 3 months ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi