1609 search results - page 133 / 322 » Problem Structure and Dependable Architecture |
115
Voted
DLT
2007
15 years 1 months ago
2007
Abstract. We investigate the state complexity of union and intersection for finite languages. Note that the problem of obtaining the tight bounds for both operations was open. We ...
81
Voted
CORR
2006
Springer
15 years 16 days ago
2006
Springer
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
98
Voted
COMPGEOM
1994
ACM
15 years 4 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
98
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper we propose an algorithm to estimate missing
values in tensors of visual data. The values can be missing
due to problems in the acquisition process, or because
the ...
128
click to vote
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...