Sciweavers

837 search results - page 54 / 168
» Dynamic Burrows-Wheeler Transform
Sort
View
ISPDC
2006
IEEE
14 years 2 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
WOWMOM
2005
ACM
106views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
A Framework for Dynamic Service Composition
To be able to utilize the generative potential of future networks for service composition, the attributes of services and networks must be appropriately formalized, stored and mad...
Paramai Supadulchai, Finn Arve Aagesen
ESOP
1999
Springer
14 years 1 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
PRICAI
1998
Springer
14 years 28 days ago
Dynamic Constraint Weighting for Over-Constrained Problems
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
John Thornton, Abdul Sattar
UIST
1995
ACM
14 years 7 days ago
SDM: Selective Dynamic Manipulation of Visualizations
In this paper we present a new set of interactive techniques for 2D and 3D visualizations. This set of techniques is called SDM (Selective Dynamic Manipulation). Selective, indica...
Mei C. Chuah, Steven F. Roth, Joe Mattis, John Kol...