2877 search results - page 143 / 576 » The Complexity of Planarity Testing |
120
click to vote
COCO
2009
Springer
15 years 11 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
160
click to vote
CGO
2004
IEEE
15 years 8 months ago
2004
IEEE
To meet the high demand for powerful embedded processors, VLIW architectures are increasingly complex (e.g., multiple clusters), and moreover, they now run increasingly sophistica...
145
click to vote
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 4 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
144
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Human activity recognition is a challenging task, especially
when its background is unknown or changing,
and when scale or illumination differs in each video.
Approaches utilizi...
135
click to vote
KDD
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we propose a novel data mining technique for the efficient damage detection within the large-scale complex mechanical structures. Every mechanical structure is defi...