5608 search results - page 864 / 1122 » On the Theory of Matchgate Computations |
411
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
172
click to vote
CHI
2009
ACM
16 years 7 months ago
2009
ACM
Over the past few years, a quiet revolution has been redefining our fundamental computing technologies. Flexible E-Ink, OLED displays, shape-changing materials, parametric design,...
185
click to vote
ICFP
2007
ACM
16 years 6 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
179
click to vote
ICS
2010
Tsinghua U.
16 years 4 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...
171
click to vote
SPAA
2009
ACM
16 years 1 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...