1541 search results - page 99 / 309 » Analysis of Random Noise and Random Walk Algorithms |
139
click to vote
ICRA
2002
IEEE
15 years 9 months ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
131
click to vote
IGPL
2006
15 years 4 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...
130
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...
136
Voted
JAL
2002
15 years 4 months ago
2002
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
170
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
We have developed methods for segmentation and tracking of cells in time-lapse phase-contrast microscopy images. Our multi-object Bayesian algorithm detects and tracks large num...