Sciweavers

4074 search results - page 721 / 815
» Defining Computational Aesthetics
Sort
View
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 9 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
CHI
2009
ACM
14 years 9 months ago
Towards systematic usability verification
Although usability is the core aspect of the whole HCI research field, it still waits for its economic breakthrough. There are some corporations that are famous for their usable p...
Jan Borchers, Jonathan Diehl, Markus Jordans, Max ...
SPAA
2009
ACM
14 years 9 months ago
Towards transactional memory semantics for C++
Transactional memory (TM) eliminates many problems associated with lock-based synchronization. Over recent years, much progress has been made in software and hardware implementati...
Tatiana Shpeisman, Ali-Reza Adl-Tabatabai, Robert ...
SPAA
2009
ACM
14 years 9 months ago
Routing without ordering
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
Bernadette Charron-Bost, Antoine Gaillard, Jennife...
PODC
2009
ACM
14 years 9 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...