Sciweavers

1520 search results - page 173 / 304
» Class Hierarchy Specialization
Sort
View
DOLAP
2006
ACM
14 years 1 months ago
A study on workload-aware wavelet synopses for point and range-sum queries
In this paper we perform an extensive theoretical and experimental study on common synopsis construction algorithms, with emphasis on wavelet based techniques, that take under con...
Michael Mathioudakis, Dimitris Sacharidis, Timos K...
ARITH
2005
IEEE
14 years 1 months ago
Synthesis of Saturating Counters Using Traditional and Non-Traditional Basic Counters
Saturating counters are a newly defined class of generalized parallel counters that provide the exact number of inputs which are equal to 1 only if this number is below a given t...
Zhaojun Wo, Israel Koren
APPROX
2005
Springer
84views Algorithms» more  APPROX 2005»
14 years 1 months ago
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
Paul Valiant
CIVR
2005
Springer
123views Image Analysis» more  CIVR 2005»
14 years 1 months ago
Region-Based Image Clustering and Retrieval Using Multiple Instance Learning
Multiple Instance Learning (MIL) is a special kind of supervised learning problem that has been studied actively in recent years. We propose an approach based on One-Class Support ...
Chengcui Zhang, Xin Chen
FSTTCS
2005
Springer
14 years 1 months ago
The Directed Planar Reachability Problem
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
Eric Allender, Samir Datta, Sambuddha Roy