Sciweavers

2698 search results - page 424 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
DM
2006
91views more  DM 2006»
13 years 9 months ago
Fast perfect sampling from linear extensions
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
Mark Huber
BILDMED
2007
107views Algorithms» more  BILDMED 2007»
13 years 10 months ago
Whole Body MRI Intensity Standardization
Abstract. A major problem of segmentation of magnetic resonance images is that intensities are not standardized like in computed tomography. This article deals with the correction ...
Florian Jäger, László G. Ny&uac...
FUIN
2008
112views more  FUIN 2008»
13 years 9 months ago
A New Probabilistic Approach for Fractal Based Image Compression
Abstract. Approximation of an image by the attractor evolved through iterations of a set of contractive maps is usually known as fractal image compression. The set of maps is calle...
Suman K. Mitra, Malay Kumar Kundu, C. A. Murthy, B...
INFOCOM
1999
IEEE
14 years 1 months ago
Matching Output Queueing with a Combined Input Output Queued Switch
-- The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure, and a need to introduce guaranteed qualities of service (QoS)....
Shang-Tse Chuang, Ashish Goel, Nick McKeown, Balaj...
TCS
2010
13 years 7 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...