Sciweavers

484 search results - page 68 / 97
» Large graph processing in the cloud
Sort
View
CN
2008
98views more  CN 2008»
15 years 3 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
RSA
2010
107views more  RSA 2010»
15 years 1 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
ICCV
1999
IEEE
16 years 5 months ago
Segmentation of Salient Closed Contours from Real Images
Using a saliency measure based on the global property of contour closure, we have developed a method that reliably segments out salient contours bounding unknown objects from real...
Shyjan Mahamud, Karvel K. Thornber, Lance R. Willi...
DAC
2006
ACM
16 years 4 months ago
Criticality computation in parameterized statistical timing
Chips manufactured in 90 nm technology have shown large parametric variations, and a worsening trend is predicted. These parametric variations make circuit optimization difficult ...
Jinjun Xiong, Vladimir Zolotov, Natesan Venkateswa...
VLSID
2008
IEEE
128views VLSI» more  VLSID 2008»
16 years 3 months ago
A Novel Approach to Compute Spatial Reuse in the Design of Custom Instructions
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul