Sciweavers

1469 search results - page 133 / 294
» Approximate polynomial decomposition
Sort
View
SMI
2008
IEEE
15 years 4 months ago
Polygonizing skeletal sheets of CT-scanned objects by partitioin of unity approximations
The skeletal structures of solid objects play an important role in medical and industrial applications. Given a volumetrically sampled solid object, our method extracts a nice-loo...
Yukie Nagai, Yutaka Ohtake, Kiwamu Kase, Hiromasa ...
AIPS
2007
15 years 9 days ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier
DAC
2005
ACM
14 years 12 months ago
Piece-wise approximations of RLCK circuit responses using moment matching
Capturing RLCK circuit responses accurately with existing model order reduction (MOR) techniques is very expensive. Direct metrics for fast analysis of RC circuits exist but there...
Chirayu S. Amin, Yehea I. Ismail, Florentin Dartu
SODA
2001
ACM
102views Algorithms» more  SODA 2001»
14 years 11 months ago
Approximate majorization and fair online load balancing
This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...
Ashish Goel, Adam Meyerson, Serge A. Plotkin
CORR
2006
Springer
150views Education» more  CORR 2006»
14 years 10 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...