Sciweavers

3894 search results - page 428 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
INFOCOM
2009
IEEE
15 years 11 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
UAI
2001
15 years 6 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
ICRA
2010
IEEE
99views Robotics» more  ICRA 2010»
15 years 3 months ago
Retraction-based RRT planner for articulated models
— We present a new retraction algorithm for high DOF articulated models and use our algorithm to improve the performance of RRT planners in narrow passages. The retraction step i...
Jia Pan, Liangjun Zhang, Dinesh Manocha
PROCEDIA
2010
113views more  PROCEDIA 2010»
15 years 3 months ago
Exploring utilisation of GPU for database applications
This study is devoted to exploring possible applications of GPU technology for acceleration of the database access. We use the n-gram based approximate text search engine as a tes...
Slawomir Walkowiak, Konrad Wawruch, Marita Nowotka...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
15 years 6 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer