Sciweavers

7015 search results - page 396 / 1403
» Approximation algorithms for co-clustering
Sort
View
APPROX
2004
Springer
89views Algorithms» more  APPROX 2004»
15 years 10 months ago
The Sketching Complexity of Pattern Matching
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, ...
ANOR
2002
100views more  ANOR 2002»
15 years 6 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
277
Voted
ICDE
2004
IEEE
121views Database» more  ICDE 2004»
16 years 8 months ago
Online Amnesic Approximation of Streaming Time Series
The past decade has seen a wealth of research on time series representations, because the manipulation, storage, and indexing of large volumes of raw time series data is impractic...
Themistoklis Palpanas, Michail Vlachos, Eamonn J. ...
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 8 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 1 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio