1096 search results - page 75 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
ICANN
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
102
click to vote
VRST
2006
ACM
15 years 5 months ago
2006
ACM
This paper presents an approach to help speed up and unify the exploration and analysis of time-dependent, volumetric data sets by easily incorporating new qualitative and quantit...
125
click to vote
DCOSS
2011
Springer
13 years 11 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
ECML
2006
Springer
15 years 3 months ago
2006
Springer
Recent scaling up of POMDP solvers towards realistic applications is largely due to point-based methods such as PBVI, Perseus, and HSVI, which quickly converge to an approximate so...
100
click to vote
CAV
2012
Springer
13 years 2 months ago
2012
Springer
An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedure...