1291 search results - page 63 / 259 » Computing the multiplicity structure in solving polynomial s... |
MEMBRANE
2009
Springer
14 years 2 months ago
2009
Springer
em is a computing model, which abstracts from the way the living cells process chemical compounds in their compartmental structure. The regions defined by a membrane structure con...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Sliding window classifiers are among the most successful and widely applied techniques for object localization. However, training is typically done in a way that is not specific to...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
PPL
2010
13 years 2 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...