Sciweavers

1089 search results - page 174 / 218
» Bounds on generalized Frobenius numbers
Sort
View
IVC
2007
102views more  IVC 2007»
13 years 8 months ago
Analysis of the rubberband algorithm
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
Fajie Li, Reinhard Klette
PRESENCE
1998
123views more  PRESENCE 1998»
13 years 8 months ago
A Real-Time Algorithm for Accurate Collision Detection for Deformable Polyhedral Objects
We propose an accurate collision detection algorithm for use in virtual reality applications. The algorithm works for three-dimensional graphical environments where multiple objec...
Yoshifumi Kitamura, Andrew Smith, Haruo Takemura, ...
PVLDB
2008
90views more  PVLDB 2008»
13 years 8 months ago
Sorting hierarchical data in external memory for archiving
Sorting hierarchical data in external memory is necessary for a wide variety of applications including archiving scientific data and dealing with large XML datasets. The topic of ...
Ioannis Koltsidas, Heiko Müller, Stratis Vigl...
JMLR
2010
143views more  JMLR 2010»
13 years 7 months ago
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
Jin Yu, S. V. N. Vishwanathan, Simon Günter, ...
NETWORKS
2010
13 years 7 months ago
A branch-and-cut algorithm for partition coloring
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...
Yuri Frota, Nelson Maculan, Thiago F. Noronha, Cel...