1661 search results - page 242 / 333 » Space-time Interest Points |
247
click to vote
ENTCS
2007
15 years 6 months ago
2007
Computing with failures is a typical programming technique in functional logic programs. However, there are also situations where a program should not fail (e.g., in a determinist...
147
click to vote
JSYML
2006
15 years 6 months ago
2006
Modifying the methods of Z. Adamowicz's paper Herbrand consistency and bounded arithmetic (Fund. Math. 171 (2002)), we show that there exists a number n such that m Sm (the u...
174
click to vote
ORL
2008
15 years 6 months ago
2008
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
169
click to vote
PAMI
2008
15 years 6 months ago
2008
In this paper, we propose an image segmentation technique based on augmenting the conformal (or geodesic) active contour framework with directional information. In the isotropic ca...
160
click to vote
PE
2008
Springer
15 years 6 months ago
2008
Springer
Following up on a recently renewed interest in computational methods for M/G/1-type processes, this paper considers an M/G/1-like system in which the service time distribution is ...