Sciweavers

652 search results - page 13 / 131
» fast 2004
Sort
View
CGF
2004
77views more  CGF 2004»
13 years 7 months ago
Stellar Mesh Simplification Using Probabilistic Optimization
This paper introduces the Stellar Simplification scheme, a fast implementation of the Four
Antônio Wilson Vieira, Thomas Lewiner, Luiz ...
ESA
2009
Springer
106views Algorithms» more  ESA 2009»
14 years 2 months ago
Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
Abstract. We consider the multivariate interlace polynomial introduced by Courcelle (2008), which generalizes several interlace polynomials defined by Arratia, Bollob´as, and Sor...
Markus Bläser, Christian Hoffmann
ROBOCUP
2004
Springer
158views Robotics» more  ROBOCUP 2004»
14 years 25 days ago
Plug and Play: Fast Automatic Geometry and Color Calibration for Cameras Tracking Robots
We have developed an automatic calibration method for a global camera system. Firstly, we show how to define automatically the color maps we use for tracking the robots’ markers...
Anna Egorova, Mark Simon, Fabian Wiesel, Alexander...
FIMI
2004
279views Data Mining» more  FIMI 2004»
13 years 9 months ago
DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets
One of the main problems raising up in the frequent closed itemsets mining problem is the duplicate detection. In this paper we propose a general technique for promptly detecting ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
GD
2004
Springer
14 years 26 days ago
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
Abstract. This paper surveys the theory of bidimensional graph problems. We summarize the known combinatorial and algorithmic results of this theory, the foundational Graph Minor r...
Erik D. Demaine, Mohammad Taghi Hajiaghayi