Sciweavers

64 search results - page 6 / 13
» Clarkson's Algorithm for Violator Spaces
Sort
View
CORR
2000
Springer
81views Education» more  CORR 2000»
13 years 7 months ago
Poly-locality in quantum computing
A polynomial depth quantum circuit affects, by definition, a poly-local unitary transformation of a tensor product state space. It is a reasonable belief [Fe], [L], [FKW] that, at ...
Michael H. Freedman
SIGIR
2006
ACM
14 years 1 months ago
You are what you say: privacy risks of public mentions
In today’s data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinion...
Dan Frankowski, Dan Cosley, Shilad Sen, Loren G. T...
ICCAD
2008
IEEE
141views Hardware» more  ICCAD 2008»
14 years 4 months ago
Layout decomposition for double patterning lithography
In double patterning lithography (DPL) layout decomposition for 45nm and below process nodes, two features must be assigned opposite colors (corresponding to different exposures)...
Andrew B. Kahng, Chul-Hong Park, Xu Xu, Hailong Ya...
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 8 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...
SIGSOFT
2006
ACM
14 years 8 months ago
SYNERGY: a new algorithm for property checking
We consider the problem if a given program satisfies a specified safety property. Interesting programs have infinite state spaces, with inputs ranging over infinite domains, and f...
Bhargav S. Gulavani, Thomas A. Henzinger, Yamini K...