Sciweavers

4277 search results - page 480 / 856
» On Multiple Linear Approximations
Sort
View
IPSN
2004
Springer
15 years 9 months ago
Locally constructed algorithms for distributed computations in ad-hoc networks
In this paper we develop algorithms for distributed computation of a broad range of estimation and detection tasks over networks with arbitrary but fixed connectivity. The distri...
Dzulkifli S. Scherber, Haralabos C. Papadopoulos
ISAAC
2004
Springer
207views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Pareto Optimality in House Allocation Problems
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...
David J. Abraham, Katarína Cechlárov...
SPIN
2004
Springer
15 years 9 months ago
Minimization of Counterexamples in SPIN
We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster th...
Paul Gastin, Pierre Moro, Marc Zeitoun
ECCV
2010
Springer
15 years 9 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
DATE
2003
IEEE
90views Hardware» more  DATE 2003»
15 years 9 months ago
Transistor-Level Static Timing Analysis by Piecewise Quadratic Waveform Matching
While fast timing analysis methods, such as asymptotic waveform evaluation (AWE), have been well established for linear circuits, the timing analysis for non-linear circuits, whic...
Zhong Wang, Jianwen Zhu