Sciweavers

23 search results - page 3 / 5
» ACM fellows
Sort
View
STOC
2012
ACM
193views Algorithms» more  STOC 2012»
11 years 11 months ago
A new point of NP-hardness for unique games
d abstract; full version begins on page 13) Ryan O’Donnell∗ John Wright† November 2, 2011 We show that distinguishing 1 2 -satisfiable Unique-Games instances from (3 8 + )-...
Ryan O'Donnell, John Wright
PODC
2011
ACM
12 years 11 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
CHI
2007
ACM
14 years 9 months ago
FASTDash: a visual dashboard for fostering awareness in software teams
Software developers spend significant time gaining and maintaining awareness of fellow developers' activities. FASTDash is a new interactive visualization that seeks to impro...
Jacob T. Biehl, Mary Czerwinski, Greg Smith, Georg...
CHI
2004
ACM
14 years 9 months ago
Trading design spaces: exchanging ideas on physical design environments
Physical design environments are places that support people engaged in the spatial, physical, tangible act of creation. It is now possible to augment workspaces with an amazing ar...
Wendy Ju, Margot Brereton, Michael Haller, Amanda ...
FOCS
2009
IEEE
14 years 3 months ago
(Meta) Kernelization
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...