Sciweavers

256 search results - page 22 / 52
» A New Synchronous Lower Bound for Set Agreement
Sort
View
ECCV
2010
Springer
14 years 10 days ago
From a Set of Shapes to Object Discovery
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
FOCS
2006
IEEE
14 years 1 months ago
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
Niv Buchbinder, Joseph Naor
CCE
2004
13 years 7 months ago
New measures and procedures to manage financial risk with applications to the planning of gas commercialization in Asia
This paper presents some new concepts and procedures for financial risk management. To complement the use of value at risk a new concept, upside potential or opportunity value as ...
Ahmed Aseeri, Miguel J. Bagajewicz
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
14 years 19 hour ago
Minimum area retiming with equivalent initial states
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
Naresh Maheshwari, Sachin S. Sapatnekar
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
14 years 1 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand