Sciweavers

844 search results - page 47 / 169
» Solving the p
Sort
View
SPAA
2009
ACM
15 years 10 months ago
The weakest failure detector for wait-free dining under eventual weak exclusion
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
Srikanth Sastry, Scott M. Pike, Jennifer L. Welch
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
15 years 10 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
ICMCS
2008
IEEE
287views Multimedia» more  ICMCS 2008»
15 years 4 months ago
Video transmission scheduling for peer-to-peer live streaming systems
For Internet based video broadcasting applications such as IPTV, the Peer-to-Peer (P2P) streaming scheme has been found to be an effective solution. An important issue in live bro...
Ying Li, Zhu Li, Mung Chiang, A. Robert Calderbank
P2P
2007
IEEE
156views Communications» more  P2P 2007»
15 years 4 months ago
Completeness Estimation of Range Queries in Structured Overlays
Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be ...
Marcel Karnstedt, Kai-Uwe Sattler, Roman Schmidt
MLDM
2007
Springer
15 years 3 months ago
PE-PUC: A Graph Based PU-Learning Approach for Text Classification
This paper presents a novel solution for the problem of building text classifier using positive documents (P) and unlabeled documents (U). Here, the unlabeled documents are mixed w...
Shuang Yu, Chunping Li