Sciweavers

1995 search results - page 155 / 399
» What's the Problem
Sort
View
ICDCS
2010
IEEE
15 years 8 months ago
P2P Streaming Capacity under Node Degree Bound
—Two of the fundamental problems in peer-to-peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algo...
Shao Liu, Minghua Chen, Sudipta Sengupta, Mung Chi...
ENTCS
2006
103views more  ENTCS 2006»
15 years 4 months ago
Supporting SAT based BMC on Finite Path Models
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
Daniel Geist, Mark Ginzburg, Yoad Lustig, Ishai Ra...
CIE
2007
Springer
15 years 10 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 11 months ago
MDS Array Codes with Optimal Rebuilding
—MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem, namely, in the case of erasures, what is the the fr...
Itzhak Tamo, Zhiying Wang, Jehoshua Bruck
ICASSP
2008
IEEE
15 years 10 months ago
Unsupervised optimal phoneme segmentation: Objectives, algorithm and comparisons
Phoneme segmentation is a fundamental problem in many speech recognition and synthesis studies. Unsupervised phoneme segmentation assumes no knowledge on linguistic contents and a...
Yu Qiao, Naoya Shimomura, Nobuaki Minematsu