Sciweavers

584 search results - page 67 / 117
» Efficient mass decomposition
Sort
View
MICS
2008
72views more  MICS 2008»
13 years 9 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
CG
2002
Springer
13 years 8 months ago
BRDC: binary representation of displacement code for line
: In raster graphics, a line is displayed as a sequence of connected pixels that best approximate the line with minimum deviation. The displacement code of a line is a sequence of ...
Lanfang Miao, Xinguo Liu, Qunsheng Peng, Hujun Bao
JUCS
2010
143views more  JUCS 2010»
13 years 7 months ago
Design of Arbiters and Allocators Based on Multi-Terminal BDDs
: Assigning one (more) shared resource(s) to several requesters is a function of arbiters (allocators). This class of decision-making modules can be implemented in a number of ways...
Václav Dvorák, Petr Mikusek
IPPS
2010
IEEE
13 years 6 months ago
Parallel external memory graph algorithms
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
Lars Arge, Michael T. Goodrich, Nodari Sitchinava
RECOMB
1998
Springer
14 years 1 months ago
The hierarchical organization of molecular structure computations
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
Cheng Che Chen, Jaswinder Pal Singh, Russ B. Altma...