Sciweavers

4926 search results - page 148 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
137
Voted
ICCSA
2007
Springer
15 years 11 months ago
Modeling Origami for Computational Construction and Beyond
Computational origami is the computer assisted study of origami as a branch of science of shapes. The origami construction is a countably finite sequence of fold steps, each consi...
Tetsuo Ida, Hidekazu Takahashi, Mircea Marin, Fado...
98
Voted
CSDA
2008
65views more  CSDA 2008»
15 years 5 months ago
Improving updating rules in multiplicative algorithms for computing D-optimal designs
In this paper we discuss a class of multiplicative algorithms for computing D-optimal designs for regression models on a finite design space. We prove a monotonicity result for a ...
Holger Dette, Andrey Pepelyshev, Anatoly A. Zhiglj...
176
Voted
GC
2008
Springer
15 years 5 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
157
Voted
JMLR
2010
118views more  JMLR 2010»
14 years 11 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
CG
2007
Springer
15 years 5 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere