Sciweavers

680 search results - page 46 / 136
» A randomized embedding algorithm for trees
Sort
View
ICIP
2004
IEEE
14 years 10 months ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler
ICIP
2005
IEEE
14 years 10 months ago
Network embedded FEC (NEF) for video multicast in presence of packet loss correlation
Network Embedded Forward Error Correction (NEF) framework is a paradigm shift from a conventional approach of providing Forward Error Correction (FEC) only on an end-to-end basis....
Shirish S. Karande, Mingquan Wu, Hayder Radha
UAI
2004
13 years 10 months ago
From Fields to Trees
We present new MCMC algorithms for computing the posterior distributions and expectations of the unknown variables in undirected graphical models with regular structure. For demon...
Firas Hamze, Nando de Freitas
PODC
2011
ACM
12 years 11 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
13 years 10 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin