Sciweavers

3341 search results - page 133 / 669
» On Bounded Queries and Approximation
Sort
View
FOCS
2002
IEEE
15 years 3 months ago
Testing Juntas
We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Co...
Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra...
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
15 years 1 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
ICDE
2010
IEEE
226views Database» more  ICDE 2010»
15 years 9 months ago
Approximation Trade-Offs in Markovian Stream Processing: An Empirical Study
Abstract-- A large amount of the world's data is both sequential and imprecise. Such data is commonly modeled as Markovian streams; examples include words/sentences inferred f...
Julie Letchner, Christopher Re, Magdalena Balazins...
ERCIMDL
2005
Springer
82views Education» more  ERCIMDL 2005»
15 years 3 months ago
A Native XML Database Supporting Approximate Match Search
XML is becoming the standard representation format for metadata. Metadata for multimedia documents, as for instance MPEG-7, require approximate match search functionalities to be s...
Giuseppe Amato, Franca Debole
TON
2008
119views more  TON 2008»
14 years 10 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...