Sciweavers

536 search results - page 54 / 108
» Some Lower Bounds for the Complexity of Continuation Methods
Sort
View
EMSOFT
2007
Springer
16 years 8 days ago
A dynamic scheduling approach to designing flexible safety-critical systems
The design of safety-critical systems has typically adopted static techniques to simplify error detection and fault tolerance. However, economic pressure to reduce costs is exposi...
Luís Almeida, Sebastian Fischmeister, Madhu...
TIT
1998
79views more  TIT 1998»
15 years 5 months ago
Greedy and Heuristic Algorithms for Codes and Colorings
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
Tuvi Etzion, Patric R. J. Östergård
DC
2008
15 years 6 months ago
Approximate distributed top- k queries
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Boaz Patt-Shamir, Allon Shafrir
CVPR
2011
IEEE
15 years 2 months ago
Multi-Level Inference by Relaxed Dual Decomposition for Human Pose Segmentation
Combining information from the higher level and the lower level has long been recognized as an essential component in holistic image understanding. However, an efficient inferenc...
Huayan Wang, Daphne Koller
ICIP
2006
IEEE
16 years 7 months ago
Self-Modulated Halftones
We propose an analytic method to overcome the trade-off between the spatial and tonal resolution of traditional clustered dot halftones. Continuous phase modulated halftones that ...
Basak Oztan, Gaurav Sharma