Sciweavers

1040 search results - page 169 / 208
» Rounding algorithms for covering problems
Sort
View
79
Voted
ICC
2007
IEEE
203views Communications» more  ICC 2007»
15 years 4 months ago
Distributed Data Aggregation Using Clustered Slepian-Wolf Coding in Wireless Sensor Networks
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
Pu Wang, Cheng Li, Jun Zheng
99
Voted
DOCENG
2009
ACM
15 years 1 months ago
Review of automatic document formatting
We review the literature on automatic document formatting with an emphasis on recent work in the field. One common way to frame document formatting is as a constrained optimizatio...
Nathan Hurst, Wilmot Li, Kim Marriott
95
Voted
DAGM
2010
Springer
14 years 10 months ago
Image Segmentation with a Statistical Appearance Model and a Generic Mumford-Shah Inspired Outside Model
Abstract. We present a novel statistical-model-based segmentation algorithm that addresses a recurrent problem in appearance model fitting and model-based segmentation: the "s...
Thomas Albrecht, Thomas Vetter
87
Voted
JMLR
2010
144views more  JMLR 2010»
14 years 4 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
MOR
2008
169views more  MOR 2008»
14 years 9 months ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang