Sciweavers

1291 search results - page 256 / 259
» Arithmetic program paths
Sort
View
JPDC
2007
96views more  JPDC 2007»
13 years 7 months ago
Optimal pipeline decomposition and adaptive network mapping to support distributed remote visualization
This paper discusses algorithmic and implementation aspects of a distributed remote visualization system that optimally decomposes and adaptively maps the visualization pipeline t...
Mengxia Zhu, Qishi Wu, Nageswara S. V. Rao, S. Sit...
EC
1998
112views ECommerce» more  EC 1998»
13 years 7 months ago
DNA Computation: Theory, Practice, and Prospects
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
Carlo C. Maley
PAMI
2002
127views more  PAMI 2002»
13 years 7 months ago
Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation
The notion of fuzzy connectedness captures the idea of "hanging-togetherness" of image elements in an object by assigning a strength of connectedness to every possible pa...
Jayaram K. Udupa, Punam K. Saha, Roberto de Alenca...
TITB
2002
76views more  TITB 2002»
13 years 7 months ago
Technology improvements for image-guided and minimally invasive spine procedures
This paper reports on technology developments aimed at improving the state of the art for image-guided minimally invasive spine procedures. Back pain is a major health problem with...
Kevin Cleary, Mark Clifford, Dan Stoianovici, Matt...
INFOCOM
2010
IEEE
13 years 5 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...