99 search results - page 18 / 20 » Uniform Characterizations of Complexity Classes of Functions |
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
ICMCS
2000
IEEE
14 years 1 days ago
2000
IEEE
The coming millenium will be characterized by the availability of multiple information appliances that make ubiquitous information access an accepted fact of life. The ability to ...
UAI
1997
13 years 9 months ago
1997
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
ICPR
2006
IEEE
14 years 8 months ago
2006
IEEE
It is possible to broadly characterize two approaches to probabilistic modeling in terms of generative and discriminative methods. Provided with sufficient training data the discr...
CVPR
2009
IEEE
14 years 2 months ago
2009
IEEE
While video-based activity analysis and recognition has received much attention, existing body of work mostly deals with single object/person case. Coordinated multi-object activi...