Sciweavers

5595 search results - page 251 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
ICDM
2007
IEEE
106views Data Mining» more  ICDM 2007»
16 years 23 days ago
High-Speed Function Approximation
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
Biswanath Panda, Mirek Riedewald, Johannes Gehrke,...
ICDE
2012
IEEE
252views Database» more  ICDE 2012»
13 years 9 months ago
Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
Chong Sun, Jeffrey F. Naughton, Siddharth Barman
ICALP
2004
Springer
15 years 11 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
FMCO
2005
Springer
173views Formal Methods» more  FMCO 2005»
15 years 12 months ago
Cluster-Based LTL Model Checking of Large Systems
Abstract. In recent years a bundle of parallel and distributed algorithms for verification of finite state systems has appeared. We survey distributed-memory enumerative LTL mode...
Jiri Barnat, Lubos Brim, Ivana Cerná
SODA
2012
ACM
223views Algorithms» more  SODA 2012»
13 years 8 months ago
Data reduction for weighted and outlier-resistant clustering
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...
Dan Feldman, Leonard J. Schulman