4103 search results - page 281 / 821 » Some results on the Collatz problem |
160
click to vote
CICLING
2010
Springer
15 years 10 months ago
2010
Springer
"Short-text clustering" is a very important research field due to the current tendency for people to use very short documents, e.g. blogs, text-messaging and others. In s...
172
Voted
WSC
1997
15 years 8 months ago
1997
This paper deals with ranking and selection problem via simulation. We present an optimal computing budget allocation technique which can select the best of k simulated designs. T...
206
click to vote
SYRCODIS
2007
15 years 8 months ago
2007
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
169
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In this paper, the problem of estimating automatically the symmetry plane of bilateral objects (having perfect or imperfect mirror symmetry) in point clouds is reexamined. Classic...
210
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...