Sciweavers

31 search results - page 3 / 7
» A comparison of join algorithms for log processing in MaPred...
Sort
View
ICASSP
2008
IEEE
14 years 1 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
ICALP
2009
Springer
14 years 7 months ago
The Number of Symbol Comparisons in QuickSort and QuickSelect
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
Brigitte Vallée, James Allen Fill, Julien C...
LCN
2006
IEEE
14 years 29 days ago
Efficient Algorithms for Secure Multicast key Management
Group Multicast is becoming a prevalent issue in Network applications such as teleconferencing, payper-view, and information services. In order to secure group communications by p...
Elham Khabiri, Saïd Bettayeb
COMPGEOM
2006
ACM
13 years 10 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
CCS
2001
ACM
13 years 10 months ago
Efficient State Updates for Key Management
Encryption is widely used to enforce usage rules for digital content. In many scenarios content is encrypted using a group key which is known to a group of users that are allowed ...
Benny Pinkas