Sciweavers

16257 search results - page 37 / 3252
» D-finiteness: algorithms and applications
Sort
View
FGCS
2006
83views more  FGCS 2006»
13 years 8 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
13 years 8 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher
JDCTA
2010
122views more  JDCTA 2010»
13 years 3 months ago
The Application Research of High-dimensional Mixed-attribute Data Clustering Algorithm
High-dimensional mixed-attribute data clustering has become an important research direction in data mining area. Because of the advantages of the information technology, data coll...
Lilin Fan, Chunhong Liu, Qian Liu
FGCN
2007
IEEE
111views Communications» more  FGCN 2007»
14 years 3 months ago
New Algorithm for Effective Utilization of Bandwidth for Sensitive Applications
In this paper, we propose an algorithm, which allocates the bandwidth in an effective manner for sensitive applications. The main idea of this work is to allocate more amount of b...
G. Varaprasad, R. S. D. Wahida Banu, Pallapa Venka...
INFOCOM
2007
IEEE
14 years 3 months ago
Pipelined van Emde Boas Tree: Algorithms, Analysis, and Applications
Abstract— Priority queues are essential for various network processing applications, including per-flow queueing with Quality-of-Service (QoS) guarantees, management of large fa...
Hao Wang, Bill Lin