4047 search results - page 198 / 810 » The Discrete Basis Problem |
124
click to vote
ECCV
2010
Springer
15 years 8 months ago
2010
Springer
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...
111
click to vote
COMPGEOM
2000
ACM
15 years 8 months ago
2000
ACM
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
114
Voted
DAC
1999
ACM
15 years 7 months ago
1999
ACM
In this survey paper we describethe combination of: discretized integral formulations, sparsication techniques, and krylov-subspace based model-order reduction that has led to rob...
128
Voted
COMPGEOM
1996
ACM
15 years 7 months ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
124
Voted
COMPGEOM
1996
ACM
15 years 7 months ago
1996
ACM
This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in...