Sciweavers

983 search results - page 113 / 197
» Continuous Queries in Oracle
Sort
View
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
15 years 4 months ago
Tolerant Linearity Testing and Locally Testable Codes
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
Swastik Kopparty, Shubhangi Saraf
ATAL
2009
Springer
15 years 4 months ago
Using relational concept knowledge to improve search in referral networks
The notion of referral networks, as presented in the work of Singh and Yolum, and their application to knowledge management, lacks two fundamental aspects; the relation of concept...
Tony White, Shawn McQuaker, Amirali Salehi-Abari
FOCS
2008
IEEE
15 years 4 months ago
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
Zoya Svitkina, Lisa Fleischer
CIE
2007
Springer
15 years 4 months ago
Speed-Up Theorems in Type-2 Computation
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
Chung-Chih Li
PODC
2006
ACM
15 years 3 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille