443 search results - page 68 / 89 » Analysis of Heuristics for Number Partitioning |
179
click to vote
SMI
2007
IEEE
16 years 7 days ago
2007
IEEE
We present an effective framework for segmenting 3D shapes into meaningful components using the curve skeleton. Our algorithm identifies a number of a critical points on the curv...
196
click to vote
ICNP
2006
IEEE
16 years 7 hour ago
2006
IEEE
— Many multicast overlay networks maintain application-specific performance goals such as bandwidth, latency, jitter and loss rate by dynamically changing the overlay structure ...
152
click to vote
INFOCOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerni...
162
click to vote
DEXA
2005
Springer
15 years 11 months ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
210
click to vote
EGPGV
2004
Springer
15 years 11 months ago
2004
Springer
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object ...