Sciweavers

149 search results - page 19 / 30
» What will they say
Sort
View
STOC
2006
ACM
168views Algorithms» more  STOC 2006»
14 years 7 months ago
A combinatorial characterization of the testable graph properties: it's all about regularity
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
Noga Alon, Eldar Fischer, Ilan Newman, Asaf Shapir...
COCO
2007
Springer
84views Algorithms» more  COCO 2007»
14 years 1 months ago
Understanding Parallel Repetition Requires Understanding Foams
Motivated by the study of Parallel Repetition and also by the Unique Games Conjecture, we investigate the value of the “Odd Cycle Games” under parallel repetition. Using tools...
Uriel Feige, Guy Kindler, Ryan O'Donnell
JELIA
2004
Springer
14 years 27 days ago
Knowledge-Theoretic Properties of Strategic Voting
Abstract. Results in social choice theory such as the Arrow and GibbardSatterthwaite theorems constrain the existence of rational collective decision making procedures in groups of...
Samir Chopra, Eric Pacuit, Rohit Parikh
SIGIR
2000
ACM
13 years 12 months ago
Topical locality in the Web
Most web pages are linked to others with related content. This idea, combined with another that says that text in, and possibly around, HTML anchors describe the pages to which th...
Brian D. Davison
ICDT
1997
ACM
108views Database» more  ICDT 1997»
13 years 11 months ago
Incorporating User Preferences in Multimedia Queries
A “scoring rule” is an assignment of a value to every tuple (of varying sizes). This paper is concerned with the issue of how to modify a scoring rule to apply to the case whe...
Ronald Fagin, Edward L. Wimmers