Sciweavers

780 search results - page 42 / 156
» Cost-Sharing Approximations for h
Sort
View
APPROX
2009
Springer
135views Algorithms» more  APPROX 2009»
14 years 2 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
CSCW
2006
ACM
14 years 1 months ago
HomeNote: supporting situated messaging in the home
In this paper we describe a field trial designed to investigate the potential of remote, situated messaging within the home. Five households used our “HomeNote” device for app...
Abigail Sellen, Richard H. R. Harper, Rachel Eardl...
CLEF
2006
Springer
13 years 11 months ago
Dublin City University at CLEF 2006: Cross-Language Speech Retrieval (CL-SR) Experiments
The Dublin City University participation in the CLEF 2006 CL-SR task concentrated on exploring the combination of the multiple fields associated with the documents. This was based...
Gareth J. F. Jones, Ke Zhang, Adenike M. Lam-Adesi...
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
13 years 11 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev
WWW
2007
ACM
14 years 8 months ago
Efficient search engine measurements
We address the problem of measuring global quality metrics of search engines, like corpus size, index freshness, and density of duplicates in the corpus. The recently proposed est...
Ziv Bar-Yossef, Maxim Gurevich