Sciweavers

2128 search results - page 343 / 426
» A general characterization of indulgence
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 5 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
14 years 4 months ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
WIKIS
2009
ACM
14 years 4 months ago
Organizing the vision for web 2.0: a study of the evolution of the concept in Wikipedia
Information Systems (IS) innovations are often characterized by buzzwords, reflecting organizing visions that structure and express the images and ideas formed by a wide community...
Arnaud Gorgeon, E. Burton Swanson
LICS
2007
IEEE
14 years 4 months ago
Game Relations and Metrics
We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a succ...
Luca de Alfaro, Rupak Majumdar, Vishwanath Raman, ...
PG
2007
IEEE
14 years 4 months ago
Genus Oblivious Cross Parameterization: Robust Topological Management of Inter-Surface Maps
We consider the problem of generating a map between two triangulated meshes, M and M’, with arbitrary and possibly differing genus. This problem has rarely been tackled in its g...
Janine Bennett, Valerio Pascucci, Kenneth I. Joy