Sciweavers

1356 search results - page 62 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
CISS
2008
IEEE
14 years 3 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
CN
2011
176views more  CN 2011»
13 years 24 days ago
Taming the elephants: New TCP slow start
Standard slow start does not work well under large bandwidthdelay product (BDP) networks. We find two causes of this problem in existing three popular operating systems, Linux, F...
Sangtae Ha, Injong Rhee
JAIR
2007
141views more  JAIR 2007»
13 years 9 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ICCV
1999
IEEE
14 years 11 months ago
Unsupervised Image Classification with a Hierarchical EM Algorithm
This work takes place in the context of hierarchical stochastic models for the resolution of discrete inverse problems from low level vision. Some of these models lie on the nodes...
Annabelle Chardin, Patrick Pérez
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 9 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...