13603 search results - page 314 / 2721 » On the Computational Complexity of Cut-Reduction |
207
click to vote
Lecture Notes
Iterative Combinatorial Auctions: Achieving Economic and Computational Efficiency Ph.D. dissertation, Univesity of Pennsylvania, May, 2001.
The focus of this chapter is on the Gen...
181
click to vote
WABI
2001
Springer
15 years 11 months ago
2001
Springer
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
157
click to vote
CP
2005
Springer
16 years 13 days ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
154
click to vote
ASPDAC
2001
ACM
15 years 10 months ago
2001
ACM
A virtual 3-D extractor of the single dielectric is presented in this paper. In the indirect boundary integral equations, the plane charge distribution on the surface of conductors...
142
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...