110 search results - page 17 / 22 » A Faster Algorithm for Quasi-convex Integer Polynomial Optim... |
106
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
107
click to vote
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...
116
click to vote
CGF
2011
14 years 1 months ago
2011
The SQuad data structure represents the connectivity of a triangle mesh by its “S table” of about 2 rpt (integer references per triangle). Yet it allows for a simple implement...
ICCV
2011
IEEE
13 years 10 months ago
2011
IEEE
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...