1951 search results - page 111 / 391 » An algorithm for improving graph partitions |
188
click to vote
DASFAA
2004
IEEE
15 years 8 months ago
2004
IEEE
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
158
click to vote
HYBRID
2010
Springer
15 years 9 months ago
2010
Springer
This paper addresses the problem of self localization of mobile devices. In particular, each device combines noisy measurements of its absolute position with distance measurements...
127
click to vote
DATE
2003
IEEE
15 years 9 months ago
2003
IEEE
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
133
click to vote
ARSCOM
2002
15 years 4 months ago
2002
Given a non-planar graph G with a subdivision of K5 as a subgraph, we can either transform the K5-subdivision into a K3,3-subdivision if it is possible, or else we obtain a partit...
129
click to vote
JSSPP
2009
Springer
15 years 11 months ago
2009
Springer
The number of applications with many parallel cooperating processes is steadily increasing, and developing efficient runtimes for their execution is an important task. Several fram...