Sciweavers

1172 search results - page 146 / 235
» Path Algorithms on Regular Graphs
Sort
View
264
Voted
EUROGRAPHICS
2010
Eurographics
15 years 11 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...
124
Voted
SSIRI
2010
15 years 28 days ago
A Formal Framework for Mutation Testing
— Model-based approaches, especially based on directed graphs (DG), are becoming popular for mutation testing as they enable definition of simple, nevertheless powerful, mutation...
Fevzi Belli, Mutlu Beyazit
131
Voted
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 6 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
137
Voted
IWDC
2005
Springer
138views Communications» more  IWDC 2005»
15 years 8 months ago
Hierarchical Routing in Sensor Networks Using k-Dominating Sets
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
Michael Q. Rieck, Subhankar Dhar
150
Voted
PR
2010
145views more  PR 2010»
15 years 29 days ago
Graph-optimized locality preserving projections
Locality preserving projections (LPP) is a typical graph-based dimensionality reduction (DR) method, and has been successfully applied in many practical problems such as face recog...
Limei Zhang, Lishan Qiao, Songcan Chen