Sciweavers

1403 search results - page 127 / 281
» Set cover algorithms for very large datasets
Sort
View
145
Voted
VIS
2004
IEEE
116views Visualization» more  VIS 2004»
16 years 5 months ago
Simplifying Flexible Isosurfaces Using Local Geometric Measures
our tree, an abstraction of a scalar field that encodes the nesting relationships of isosurfaces, can be used to accelerate isosurface extraction, to identify important isovalues ...
Hamish Carr, Jack Snoeyink, Michiel van de Panne
AI
2010
Springer
15 years 4 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
163
Voted
ICDE
2012
IEEE
238views Database» more  ICDE 2012»
13 years 7 months ago
Mining Knowledge from Data: An Information Network Analysis Approach
Abstract—Most objects and data in the real world are interconnected, forming complex, heterogeneous but often semistructured information networks. However, many database research...
Jiawei Han, Yizhou Sun, Xifeng Yan, Philip S. Yu
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 5 months ago
On the need for time series data mining benchmarks: a survey and empirical demonstration
In the last decade there has been an explosion of interest in mining time series data. Literally hundreds of papers have introduced new algorithms to index, classify, cluster and s...
Eamonn J. Keogh, Shruti Kasetty
154
Voted
CORR
2008
Springer
136views Education» more  CORR 2008»
15 years 4 months ago
Multi-Armed Bandits in Metric Spaces
In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of n trials so as to maximize the total payoff of the chosen strategies. While ...
Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal