485 search results - page 73 / 97 » Unconstraint Assignment Problem: A Molecular Computing Appro... |
ICCV
2003
IEEE
14 years 24 days ago
2003
IEEE
Conventional tracking approaches assume proximity in space, time and appearance of objects in successive observations. However, observations of objects are often widely separated ...
CONCUR
2001
Springer
14 years 13 hour ago
2001
Springer
It has long been recognised that standard process algebra has difficulty dealing with actions of different priority, such as for instance an interrupt action of high priority. Va...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
Abstract— Many of today’s data-intensive applications manipulate disk-resident data sets. As a result, their overall behavior is tightly coupled with their disk performance. Un...
ECCV
2010
Springer
14 years 25 days ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
BMCBI
2010
13 years 7 months ago
2010
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...