Sciweavers

2434 search results - page 132 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
SIGIR
1992
ACM
15 years 7 months ago
A Faster Algorithm for Constructing Minimal Perfect Hash Functions
Our previous research on one-probe access to large collections of data indexed by alphanumeric keys has produced the first practical minimal perfect hash functions for this proble...
Edward A. Fox, Qi Fan Chen, Lenwood S. Heath
136
Voted
CCE
2004
15 years 3 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
117
Voted
CIKM
2001
Springer
15 years 8 months ago
A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels
In a wireless environment, the bandwidth of the channels and the energy of the portable devices are limited. Data broadcast has become an excellent method for efficient data disse...
Chih-Hao Hsu, Guanling Lee, Arbee L. P. Chen
127
Voted
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
14 years 10 months ago
An adaptive-covariance-rank algorithm for the unscented Kalman filter
Abstract-- The Unscented Kalman Filter (UKF) is a nonlinear estimator that is particularly well suited for complex nonlinear systems. In the UKF, the error covariance is estimated ...
Lauren E. Padilla, Clarence W. Rowley
167
Voted
COLT
2010
Springer
15 years 1 months ago
Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
Alekh Agarwal, Ofer Dekel, Lin Xiao