Sciweavers

26 search results - page 5 / 6
» cpm 2010
Sort
View
CPM
2010
Springer
175views Combinatorics» more  CPM 2010»
15 years 2 months ago
Compression, Indexing, and Retrieval for Massive String Data
The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original i...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
68
Voted
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
15 years 2 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
59
Voted
CPM
2010
Springer
120views Combinatorics» more  CPM 2010»
15 years 2 months ago
Mod/Resc Parsimony Inference
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Eng...
TWC
2010
14 years 4 months ago
Credit pre-reservation mechanism for UMTS prepaid service
Online Charging System (OCS) supports multiple prepaid and postpaid sessions simultaneously. Through credit reservation, the OCS assigns some credit units to a session. These credi...
Hsin-Yi Lee, Yi-Bing Lin
TWC
2010
14 years 4 months ago
A Novel Graph-Based Suboptimal Multiuser Detector for FDM-CPM Transmissions
We consider a frequency division multiplexed (FDM) system where each user employs a continuous phase modulation (CPM), serially concatenated with an outer code through an interleav...
Amina Piemontese, Giulio Colavolpe