Sciweavers

2542 search results - page 260 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
111
Voted
IANDC
2006
102views more  IANDC 2006»
15 years 17 days ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...
CVPR
2012
IEEE
13 years 3 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
125
Voted
ICCV
1998
IEEE
16 years 2 months ago
Design of Multi-Parameter Steerable Functions Using Cascade Basis Reduction
A new cascade basis reduction method of computing the optimal least-squares set of basis functions to steer a given function locally is presented. The method combines the Lie grou...
Patrick C. Teo, Yacov Hel-Or
104
Voted
IPPS
2009
IEEE
15 years 7 months ago
Scalability challenges for massively parallel AMR applications
PDE solvers using Adaptive Mesh Refinement on block structured grids are some of the most challenging applications to adapt to massively parallel computing environments. We descr...
Brian van Straalen, John Shalf, Terry J. Ligocki, ...
ICRA
2006
IEEE
131views Robotics» more  ICRA 2006»
15 years 6 months ago
Proximity Queries between Convex Objects: an Interior Point Approach for Implicit Surfaces
— This paper presents an interior point approach to exact distance computation between convex objects represented as intersections of implicit surfaces. Exact distance computatio...
Nilanjan Chakraborty, Jufeng Peng, Srinivas Akella...