17541 search results - page 3349 / 3509 » Complexity in scalable computing |
133
click to vote
INFORMS
1998
15 years 2 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
151
click to vote
INFORMS
1998
15 years 2 months ago
1998
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
110
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
: In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thu...
166
click to vote
PAMI
2002
15 years 2 months ago
2002
We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Si...
135
click to vote
SAC
2002
ACM
15 years 2 months ago
2002
ACM
Designing realistic multi-agent systems is a complex process, which involves specifying not only the functionality of individual agents, but also the authority relationships and l...