Sciweavers

199 search results - page 15 / 40
» On some Algorithmic Problems for Groups and Monoids
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
ACL
1994
13 years 9 months ago
A Stochastic Finite-State Word-Segmentation Algorithm for Chinese
We present a stochastic finite-state model for segmenting Chinese text into dictionary entries and productively derived words, and providing pronunciations for these words; the me...
Richard Sproat, Chilin Shih, William Gale, Nancy C...
GLOBECOM
2007
IEEE
13 years 11 months ago
mQMA: Multi-Constrained QoS Multicast Aggregation
Traditional IP Multicast has been proposed in order to manage group communications over the Internet in a bandwidth efficient manner. Although this proposition has been well studie...
Naouel Ben Ali, Joanna Moulierac, Abdelfattah Belg...
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck