Sciweavers

3630 search results - page 140 / 726
» Fast Marching Methods
Sort
View
VLSM
2005
Springer
15 years 11 months ago
Trimap Segmentation for Fast and User-Friendly Alpha Matting
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
Olivier Juan, Renaud Keriven
ACMDIS
2000
ACM
15 years 10 months ago
Just-in-Time Design in a Fast-Paced Product Group
In real world development environments where deadlines are fixed, a designer must craft a process that works with the team and within the constraints of a project. The traditional...
Margo Lustig Ezekiel
ADBIS
1998
Springer
118views Database» more  ADBIS 1998»
15 years 10 months ago
Itemset Materializing for Fast Mining of Association Rules
Mining association rules is an important data mining problem. Association rules are usually mined repeatedly in different parts of a database. Current algorithms for mining associa...
Marek Wojciechowski, Maciej Zakrzewicz
ISHPC
2000
Springer
15 years 10 months ago
Fast Isosurface Generation Using the Cell-Edge Centered Propagation Algorithm
Isosurface generation algorithms usually need a vertex-identification process since most of polygon-vertices of an isosurface are shared by several polygons. In our observation the...
Takayuki Itoh, Yasushi Yamaguchi, Koji Koyamada
IJCAI
2007
15 years 7 months ago
A Fast Analytical Algorithm for Solving Markov Decision Processes with Real-Valued Resources
Agents often have to construct plans that obey deadlines or, more generally, resource limits for real-valued resources whose consumption can only be characterized by probability d...
Janusz Marecki, Sven Koenig, Milind Tambe