Sciweavers

2366 search results - page 279 / 474
» Mapping time
Sort
View
132
Voted
DCG
2008
93views more  DCG 2008»
15 years 3 months ago
Odd Crossing Number and Crossing Number Are Not the Same
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
130
Voted
IJPP
2008
148views more  IJPP 2008»
15 years 3 months ago
Analysis and Optimisation of Hierarchically Scheduled Multiprocessor Embedded Systems
We present an approach to the analysis and optimisation of heterogeneous multiprocessor embedded systems. The systems are heterogeneous not only in terms of hardware components, b...
Traian Pop, Paul Pop, Petru Eles, Zebo Peng
123
Voted
JEA
2008
88views more  JEA 2008»
15 years 3 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
147
Voted
GIS
2007
ACM
15 years 3 months ago
Contour line thinning and multigrid generation of raster-based digital elevation models
Thin plate spline interpolation is a widely used approach to generate a digital elevation model (DEM) from contour lines and scattered data. In practice, contour maps are scanned a...
Endre Katona
122
Voted
PE
2006
Springer
127views Optimization» more  PE 2006»
15 years 3 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen