Sciweavers

185 search results - page 28 / 37
» A Simple Min Cut Algorithm
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Network Coding for Multi-Resolution Multicast
—Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distribu...
MinJi Kim, Daniel Enrique Lucani, Xiaomeng Shi, Fa...
BMCBI
2007
151views more  BMCBI 2007»
13 years 7 months ago
A comparison study on algorithms of detecting long forms for short forms in biomedical text
Motivation: With more and more research dedicated to literature mining in the biomedical domain, more and more systems are available for people to choose from when building litera...
Manabu Torii, Zhang-Zhi Hu, Min Song, Cathy H. Wu,...
FOCS
1995
IEEE
13 years 11 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
CORR
2011
Springer
243views Education» more  CORR 2011»
13 years 2 months ago
Deterministic Network Model Revisited: An Algebraic Network Coding Approach
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
MinJi Kim, Elona Erez, Edmund M. Yeh, Muriel M&eac...
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
13 years 7 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan