1632 search results - page 227 / 327 » Sublinear Time Algorithms for Metric Space Problems |
124
Voted
FMCAD
2004
Springer
15 years 7 months ago
2004
Springer
The main challenge in BDD-based verification is dealing with the memory explosion problem during reachability analysis. In this paper we advocate a methodology to handle this probl...
138
click to vote
3DIM
2005
IEEE
15 years 9 months ago
2005
IEEE
Many optimization processes encounter a problem in efficiently reaching a global minimum or a near global minimum. Traditional methods such as Levenberg-Marquardt algorithm and t...
186
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we study the online learning problem involving rested and restless multiarmed bandits with multiple plays. The system consists of a single player/user and a set of K...
157
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
141
Voted
EDBT
2004
ACM
16 years 3 months ago
2004
ACM
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...