2255 search results - page 320 / 451 » Computing a Center-Transversal Line |
CGF
2010
14 years 11 months ago
2010
This paper presents a straightforward algorithm for constructing connections on discrete surfaces that are as smooth as possible everywhere but on a set of isolated singularities ...
IJCGA
2006
14 years 11 months ago
2006
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
GI
2007
Springer
15 years 5 months ago
2007
Springer
: Unternehmen wollen ihre Softwaresysteme heute in allen Branchen und insbesondere auch in der Logistik zu serviceorientierten Anwendungslandschaften mit sauber geschnittenen fachl...
AAAI
2004
15 years 17 days ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...
NIPS
2004
15 years 17 days ago
2004
The computation of classical higher-order statistics such as higher-order moments or spectra is difficult for images due to the huge number of terms to be estimated and interprete...