Sciweavers

186 search results - page 32 / 38
» A Numerical Adaptive Algorithm for the Obstacle Problem
Sort
View
MMB
2010
Springer
185views Communications» more  MMB 2010»
14 years 11 months ago
Correctness Issues of Symbolic Bisimulation Computation for Markov Chains
Abstract. Bisimulation reduction is a classical means to fight the infamous state space explosion problem, which limits the applicability of automated methods for verification li...
Ralf Wimmer, Bernd Becker
INFOCOM
2008
IEEE
15 years 4 months ago
End-to-End Resource Allocation in OFDM Based Linear Multi-Hop Networks
— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
Xiaolu Zhang, Wenhua Jiao, Meixia Tao
CVPR
2011
IEEE
14 years 7 months ago
Dynamic Batch Mode Active Learning
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...
Shayok Chakraborty, Vineeth Balasubramanian, Sethu...
89
Voted
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
Fitted BVH for Fast Raytracing of Metaballs
Raytracing metaballs is a problem that has numerous applications in the rendering of dynamic soft objects such as fluids. However, current techniques are either limited in the vi...
Olivier Gourmel, Anthony Pajot, Mathias Paulin, Lo...
CISS
2008
IEEE
15 years 4 months ago
Relay selection methods for wireless cooperative communications
— We study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, we seek...
Seunghoon Nam, Mai Vu, Vahid Tarokh