Sciweavers

40 search results - page 7 / 8
» approx 2006
Sort
View
APPROX
2008
Springer
90views Algorithms» more  APPROX 2008»
13 years 7 months ago
Tensor Products of Weakly Smooth Codes Are Robust
: We continue the study of robustly testable tensor codes and expand the class of base codes that can be used as a starting point for the construction of locally testable codes via...
Eli Ben-Sasson, Michael Viderman
DATAMINE
2006
142views more  DATAMINE 2006»
13 years 5 months ago
Sequential Pattern Mining in Multi-Databases via Multiple Alignment
To efficiently find global patterns from a multi-database, information in each local database must first be mined and summarized at the local level. Then only the summarized infor...
Hye-Chung Kum, Joong Hyuk Chang, Wei Wang 0010
JAT
2010
80views more  JAT 2010»
13 years 3 months ago
The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator Π g C and the relative projection operator P g C in...
Chong Li, Wen Song, Jen-Chih Yao
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
13 years 9 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
APPROX
2006
Springer
89views Algorithms» more  APPROX 2006»
13 years 9 months ago
Online Algorithms to Minimize Resource Reallocations and Network Communication
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
Sashka Davis, Jeff Edmonds, Russell Impagliazzo