6142 search results - page 700 / 1229 » The Complexity of Partition Functions |
202
click to vote
ICCAD
2003
IEEE
16 years 4 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
170
click to vote
TCC
2010
Springer
16 years 4 months ago
2010
Springer
We study rationality in protocol design for the full-information model, a model characterized by computationally unbounded adversaries, no private communication, and no simultanei...
170
click to vote
PADL
2010
Springer
16 years 4 months ago
2010
Springer
Abstract. Skeletons simplify parallel programming by providing general patterns of parallel computations. When several skeletons are used inside the same program, skeleton composit...
168
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
The traditional SPM approach based on bag-of-features (BoF) must use nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effec...
167
Voted
CGO
2009
IEEE
16 years 1 months ago
2009
IEEE
Compilers employ many aggressive code transformations to achieve highly optimized code. However, because of complex target architectures and unpredictable optimization interaction...