Sciweavers

478 search results - page 83 / 96
» Improving probability bounds by optimization over subsets
Sort
View
APPROX
2004
Springer
100views Algorithms» more  APPROX 2004»
14 years 28 days ago
Estimating the Distance to a Monotone Function
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
Nir Ailon, Bernard Chazelle, Seshadhri Comandur, D...
ECOOP
2008
Springer
13 years 9 months ago
Online Phase-Adaptive Data Layout Selection
Good data layouts improve cache and TLB performance of object-oriented software, but unfortunately, selecting an optimal data layout a priori is NP-hard. This paper introduces layo...
Chengliang Zhang, Martin Hirzel
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 9 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
TCSV
2002
229views more  TCSV 2002»
13 years 7 months ago
Automatic segmentation of moving objects in video sequences: a region labeling approach
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...
Yaakov Tsaig, Amir Averbuch
ICDE
2009
IEEE
179views Database» more  ICDE 2009»
14 years 2 months ago
Self-Tuning, Bandwidth-Aware Monitoring for Dynamic Data Streams
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
Navendu Jain, Praveen Yalagandula, Michael Dahlin,...