Sciweavers

2638 search results - page 240 / 528
» Random Geometric Complexes
Sort
View
GLOBECOM
2010
IEEE
15 years 4 months ago
A Distributed Wake-Up Scheduling for Opportunistic Forwarding in Wireless Sensor Networks
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
Chul-Ho Lee, Do Young Eun
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
15 years 10 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt
EUROGRAPHICS
2010
Eurographics
16 years 2 months ago
Practical quad mesh simplification
n this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. T...
Marco Tarini, Nico Pietroni, Paolo Cignoni, Daniel...
TOG
2008
102views more  TOG 2008»
15 years 6 months ago
A meshless hierarchical representation for light transport
We introduce a meshless hierarchical representation for solving light transport problems. Precomputed radiance transfer (PRT) and finite elements require a discrete representation...
Jaakko Lehtinen, Matthias Zwicker, Emmanuel Turqui...
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
15 years 10 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar