3145 search results - page 55 / 629 » Key Improvements to XTR |
153
click to vote
MOC
2010
15 years 1 months ago
2010
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...
164
click to vote
ICANN
2009
Springer
16 years 26 days ago
2009
Springer
Abstract. We demonstrate that selective attention can improve learning. Considerably fewer samples are needed to learn a source separation problem when the inputs are pre-segmented...
146
click to vote
MWCN
2004
Springer
15 years 11 months ago
2004
Springer
— We consider node localization problems in ad hoc wireless networks in which two types of nodes are considered: nodes with self-locating capability like GPS and nodes with no se...
154
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
Arrangements of planar curves are fundamental structures in computational geometry. We describe the recent developments in the arrangement package of Cgal, the Computational Geomet...
137
click to vote
EOR
2008
15 years 6 months ago
2008
In this paper, a simulated annealing algorithm is presented for the Bandwidth Minimization Problem for Graphs. This algorithm is based on three distinguished features including an...