Sciweavers

5138 search results - page 836 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
SIAMCOMP
1998
96views more  SIAMCOMP 1998»
15 years 6 months ago
Fault-Tolerant Computation in the Full Information Model
We initiate an investigation of general fault-tolerant distributed computation in the full-information model. In the full information model no restrictions are made on the computat...
Oded Goldreich, Shafi Goldwasser, Nathan Linial
TJS
2002
160views more  TJS 2002»
15 years 6 months ago
Adaptive Optimizing Compilers for the 21st Century
Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This...
Keith D. Cooper, Devika Subramanian, Linda Torczon
WINET
2002
163views more  WINET 2002»
15 years 6 months ago
TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks
Abstract. TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless netwo...
Claudio Casetti, Mario Gerla, Saverio Mascolo, M. ...
CORR
2011
Springer
155views Education» more  CORR 2011»
15 years 1 months ago
Reconciling Compressive Sampling Systems for Spectrally-sparse Continuous-time Signals
The Random Demodulator (RD) and the Modulated Wideband Converter (MWC) are two recently proposed compressed sensing (CS) techniques for the acquisition of continuous-time spectral...
Michael A. Lexa, Mike E. Davies, John S. Thompson
ECCV
2004
Springer
16 years 8 months ago
Interactive Image Segmentation Using an Adaptive GMMRF Model
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
Andrew Blake, Carsten Rother, M. Brown, Patrick P&...