Sciweavers

9842 search results - page 339 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICPR
2004
IEEE
16 years 5 months ago
Complex Human Activity Recognition for Monitoring Wide Outdoor Environments
The problem of automatic recognition of human activities is among the most important and challenging open areas of research in Computer Vision. This paper presents a new approach ...
Arcangelo Distante, I. Gnoni, Marco Leo, Paolo Spa...
ICPR
2002
IEEE
16 years 5 months ago
Object Detection in Images: Run-Time Complexity and Parameter Selection of Support Vector Machines
In this paper we address two aspects related to the exploitation of Support Vector Machines (SVM) for classification in real application domains, such as the detection of objects ...
Nicola Ancona, Grazia Cicirelli, Ettore Stella, Ar...
CHI
2001
ACM
16 years 4 months ago
Beyond command knowledge: identifying and teaching strategic knowledge for using complex computer applications
Despite experience, many users do not make efficient use of complex computer applications. We argue that this is caused by a lack of strategic knowledge that is difficult to acqui...
Suresh K. Bhavnani, Frederick Reif, Bonnie E. John
ICC
2009
IEEE
190views Communications» more  ICC 2009»
15 years 10 months ago
Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
Vinay Kolar, Nael B. Abu-Ghazaleh, Petri Mäh&...
LPNMR
2009
Springer
15 years 10 months ago
The Complexity of Circumscriptive Inference in Post's Lattice
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...
Michael Thomas