Sciweavers

2498 search results - page 359 / 500
» Algorithms for the Topological Watershed
Sort
View
WWW
2006
ACM
14 years 8 months ago
Probabilistic models for discovering e-communities
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, H...
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
14 years 8 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
EUROGRAPHICS
2010
Eurographics
14 years 5 months ago
Real-time Rendering of Heterogeneous Translucent Objects with Arbitrary Shapes
We present a real-time algorithm for rendering translucent objects of arbitrary shapes. We approximate the scattering of light inside the objects using the diffusion equation, whi...
Yajun Wang, Jiaping Wang, Nicolas Holzschuch, Kart...
ICCAD
2008
IEEE
150views Hardware» more  ICCAD 2008»
14 years 5 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
Gennette Gill, Vishal Gupta, Montek Singh
ICCAD
2006
IEEE
125views Hardware» more  ICCAD 2006»
14 years 5 months ago
Leveraging protocol knowledge in slack matching
Stalls, due to mis-matches in communication rates, are a major performance obstacle in pipelined circuits. If the rate of data production is faster than the rate of consumption, t...
Girish Venkataramani, Seth Copen Goldstein