Sciweavers

3049 search results - page 332 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 7 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
MP
2008
135views more  MP 2008»
15 years 6 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
RTSS
2005
IEEE
16 years 7 days ago
Optimal Task Rate Selection in Fixed Priority Systems
The design phase of any real-time system requires balancing the limited computational resources against the functional requirements and the performance of the application. The opt...
Enrico Bini, Marco Di Natale
CVPR
2009
IEEE
17 years 1 months ago
Projective Least-Squares: Global Solutions with Local Optimization
Recent work in multiple view geometry has focused on obtaining globally optimal solutions at the price of computational time efciency. On the other hand, traditional bundle adj...
Carl Olsson, Fredrik Kahl, Richard I. Hartley
DAC
2005
ACM
15 years 8 months ago
Circuit optimization using statistical static timing analysis
In this paper, we propose a new sensitivity based, statistical gate sizing method. Since circuit optimization effects the entire shape of the circuit delay distribution, it is dif...
Aseem Agarwal, Kaviraj Chopra, David Blaauw, Vladi...