Sciweavers

765 search results - page 47 / 153
» Empirical Design of Geometric Algorithms
Sort
View
JMLR
2008
209views more  JMLR 2008»
14 years 11 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
ISPD
2012
ACM
234views Hardware» more  ISPD 2012»
13 years 7 months ago
MAPLE: multilevel adaptive placement for mixed-size designs
We propose a new multilevel framework for large-scale placement called MAPLE that respects utilization constraints, handles movable macros and guides the transition between global...
Myung-Chul Kim, Natarajan Viswanathan, Charles J. ...
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
15 years 1 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
ALGORITHMICA
2000
125views more  ALGORITHMICA 2000»
14 years 11 months ago
Mobile Robot Self-Localization without Explicit Landmarks
Localization is the process of determining the robot's location within its environment. More precisely, it is a procedure which takes as input a geometric map, a current estim...
R. G. Brown, Bruce Randall Donald
DCOSS
2005
Springer
15 years 5 months ago
Design and Comparison of Lightweight Group Management Strategies in EnviroSuite
Tracking is one of the major applications of wireless sensor networks. EnviroSuite, as a programming paradigm, provides a comprehensive solution for programming tracking applicatio...
Liqian Luo, Tarek F. Abdelzaher, Tian He, John A. ...