3333 search results - page 200 / 667 » Abstract Proof Search |
126
click to vote
EVOW
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
132
click to vote
SAGA
2001
Springer
15 years 8 months ago
2001
Springer
We study the combinatorial optimization task of choosing the smoothest map from a given family of maps, which is motivated from motor control unit calibration. The problem is of a ...
161
click to vote
ERCIMDL
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We present an approach to increasing the effectiveness of rankedoutput retrieval systems that relies on graphical display and user manipulation of “views” of retrieva...
159
click to vote
ECML
1997
Springer
15 years 8 months ago
1997
Springer
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
139
click to vote
DEXA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...