Sciweavers

199 search results - page 9 / 40
» Approximating Center Points with Iterated Radon Points
Sort
View
CCCG
2008
13 years 9 months ago
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
A. Karim Abu-Affash, Matthew J. Katz
DATE
2009
IEEE
163views Hardware» more  DATE 2009»
14 years 2 months ago
Fixed points for multi-cycle path detection
—Accurate timing analysis is crucial for obtaining the optimal clock frequency, and for other design stages such as power analysis. Most methods for estimating propagation delay ...
Vijay D'Silva, Daniel Kroening
NIPS
2003
13 years 9 months ago
Approximate Policy Iteration with a Policy Language Bias
We study an approach to policy selection for large relational Markov Decision Processes (MDPs). We consider a variant of approximate policy iteration (API) that replaces the usual...
Alan Fern, Sung Wook Yoon, Robert Givan
ICASSP
2011
IEEE
12 years 11 months ago
From maximum likelihood to iterative decoding
Iterative decoding is considered in this paper from an optimization point of view. Starting from the optimal maximum likelihood decoding, a (tractable) approximate criterion is de...
Florence Alberge, Ziad Naja, Pierre Duhamel
AMC
2007
89views more  AMC 2007»
13 years 7 months ago
A numerical iterative scheme for computing finite order rank-one convex envelopes
It is known that the i-th order laminated microstructures can be resolved by the k-th order rank-one convex envelopes with k ≥ i. So the requirement of establishing an efficient ...
Xin Wang, Zhiping Li