Sciweavers

4926 search results - page 564 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
TOG
2012
206views Communications» more  TOG 2012»
13 years 5 months ago
Beady: interactive beadwork design and construction
We introduce the interactive system “Beady” to assist the design and construction of customized 3D beadwork. The user first creates a polygonal mesh model called the design m...
Yuki Igarashi, Takeo Igarashi, Jun Mitani
ECCV
2008
Springer
16 years 5 months ago
Video Registration Using Dynamic Textures
We propose a dynamic texture feature-based algorithm for registering two video sequences of a rigid or nonrigid scene taken from two synchronous or asynchronous cameras. We model e...
Avinash Ravichandran, René Vidal
133
Voted
AFRIGRAPH
2003
ACM
15 years 7 months ago
Efficient clustering and visibility calculation for global illumination
Using a radiosity method to estimate light inter-reflections within large scenes still remains a difficult task. The two main reasons are: (i) the computations entailed by the rad...
Daniel Meneveaux, Kadi Bouatouch, Gilles Subrenat,...
MSWIM
2006
ACM
15 years 9 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
183
Voted
WWW
2010
ACM
15 years 10 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...