900 search results - page 22 / 180 » On Polynomial Time Computation over Unordered Structures |
129
click to vote
ECCV
2004
Springer
16 years 3 months ago
2004
Springer
Detecting low-level image features such as edges and ridges with spatial filters is improved if the scale of the features are known a priori. Scale-space representations and wavele...
ISSAC
2009
Springer
15 years 8 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
AISC
2004
Springer
15 years 7 months ago
2004
Springer
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
104
click to vote
MICCAI
1999
Springer
15 years 6 months ago
1999
Springer
Abstract. We present a computer vision system that automatically detects pulmonary nodules in computed tomography (CT) scans of oncology patients, performs size analysis and assess...
115
click to vote
CDB
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...