10988 search results - page 208 / 2198 » Algorithmic Folding Complexity |
149
Voted
ICCAD
1992
IEEE
15 years 7 months ago
1992
IEEE
In this paper we describe combining a mesh analysis equation formulation technique with a preconditioned GORES matrix solution algorithm to accelerate the determination of inducta...
157
Voted
CATS
2008
15 years 5 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
103
Voted
JC
2000
15 years 3 months ago
2000
We study the complexity of approximating the Stieltjes integral R 1 0 f(x)dg(x) for functions f having r continuous derivatives and functions g whose sth derivative has bounded va...
128
Voted
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
Complex human motion sequences (such as dances) are typically analyzed by segmenting them into shorter motion sequences, called gestures. However, this segmentation process is sub...
191
Voted
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
Reference reconciliation is the problem of identifying when different references (i.e., sets of attribute values) in a dataset correspond to the same real-world entity. Most previ...