Sciweavers

663 search results - page 32 / 133
» Algorithms for Computing Minimal Unsatisfiable Subsets of Co...
Sort
View
COMCOM
2006
75views more  COMCOM 2006»
13 years 7 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
JPDC
2007
177views more  JPDC 2007»
13 years 7 months ago
Adaptive decomposition and remapping algorithms for object-space-parallel direct volume rendering of unstructured grids
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
Cevdet Aykanat, Berkant Barla Cambazoglu, Ferit Fi...
GIS
2011
ACM
12 years 11 months ago
Embedding rivers in triangulated irregular networks with linear programming
Data conflation is a major issue in GIS: different geospatial data sets covering overlapping regions, possibly obtained from different sources and using different acquisition ...
Marc J. van Kreveld, Rodrigo I. Silveira
ICPP
2009
IEEE
14 years 2 months ago
Optimizing the Latency of Streaming Applications under Throughput and Reliability Constraints
In this paper, we deal with the problem of scheduling streaming applications on unreliable heterogeneous platforms. We use the realistic one-port model with full computation/commu...
Anne Benoit, Mourad Hakem, Yves Robert
CODES
2003
IEEE
14 years 1 months ago
Design space minimization with timing and code size optimization for embedded DSP
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
Qingfeng Zhuge, Zili Shao, Bin Xiao, Edwin Hsing-M...