Sciweavers

6142 search results - page 262 / 1229
» The Complexity of Partition Functions
Sort
View
SC
2005
ACM
15 years 11 months ago
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadthï¬...
Andy Yoo, Edmond Chow, Keith W. Henderson, Will Mc...
PPSWR
2005
Springer
15 years 11 months ago
Computational Treatment of Temporal Notions: The CTTN-System
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
Hans Jürgen Ohlbach
IAJIT
2008
134views more  IAJIT 2008»
15 years 6 months ago
A Dynamic Traffic Shaping Technique for a Scalable QoS in ATM Networks
: Traffic shaping function becomes imperative for the new broadband services that are being deployed in order to avoid information loss, to provide the end users multiple traffic o...
Francis Joseph Ogwu, Mohammad Talib, Ganiyu Aderou...
CVGIP
2007
136views more  CVGIP 2007»
15 years 6 months ago
Contour-based surface reconstruction using MPU implicit models
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
Ilya Braude, Jeffrey Marker, Ken Museth, Jonathan ...
ACTA
2008
88views more  ACTA 2008»
15 years 4 months ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish