Sciweavers

1554 search results - page 266 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
SIGGRAPH
1995
ACM
15 years 1 months ago
Multiresolution analysis of arbitrary meshes
In computer graphics and geometric modeling, shapes are often represented by triangular meshes. With the advent of laser scanning systems, meshes of extreme complexity are rapidly...
Matthias Eck, Tony DeRose, Tom Duchamp, Hugues Hop...
88
Voted
SIAMSC
2008
131views more  SIAMSC 2008»
14 years 10 months ago
Gramian-Based Model Reduction for Data-Sparse Systems
Model order reduction (MOR) is common in simulation, control and optimization of complex dynamical systems arising in modeling of physical processes and in the spatial discretizati...
Ulrike Baur, Peter Benner
WISEC
2009
ACM
15 years 5 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
INFOCOM
2009
IEEE
15 years 4 months ago
Surface Coverage in Wireless Sensor Networks
—Coverage is a fundamental problem in Wireless Sensor Networks (WSNs). Existing studies on this topic focus on 2D ideal plane coverage and 3D full space coverage. In many real wo...
Ming-Chen Zhao, Jiayin Lei, Min-You Wu, Yunhuai Li...
87
Voted
ATAL
2007
Springer
15 years 4 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...