Sciweavers

3872 search results - page 620 / 775
» The Java memory model
Sort
View
ICML
2010
IEEE
13 years 11 months ago
Online Learning for Group Lasso
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
Haiqin Yang, Zenglin Xu, Irwin King, Michael R. Ly...
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
13 years 10 months ago
Conservative swept volume boundary approximation
We present a novel technique for approximating the boundary of a swept volume. The generator given by an input triangle mesh is rendered under all rigid transformations of a discr...
Andreas von Dziegielewski, R. Erbes, Elmar Sch&oum...
CGF
2006
136views more  CGF 2006»
13 years 10 months ago
Cache-Efficient Layouts of Bounding Volume Hierarchies
We present a novel algorithm to compute cache-efficient layouts of bounding volume hierarchies (BVHs) of polygonal models. Our approach does not make any assumptions about the cac...
Sung-Eui Yoon, Dinesh Manocha
FGCS
2006
119views more  FGCS 2006»
13 years 10 months ago
OpenMP versus MPI for PDE solvers based on regular sparse numerical operators
Tw o parallel programming models represented b y OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an app...
Markus Nordén, Sverker Holmgren, Michael Th...
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 10 months ago
Graph rigidity, Cyclic Belief Propagation and Point Pattern Matching
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
Julian John McAuley, Tibério S. Caetano, Ma...