Sciweavers

1795 search results - page 303 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
IJCV
2007
138views more  IJCV 2007»
13 years 9 months ago
Correspondence-free Structure from Motion
We present a novel approach for the estimation of 3D-motion directly from two images using the Radon transform. The feasibility of any camera motion is computed by integrating over...
Ameesh Makadia, Christopher Geyer, Kostas Daniilid...
JANCL
2007
115views more  JANCL 2007»
13 years 9 months ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
JCP
2007
126views more  JCP 2007»
13 years 9 months ago
ADE: Utility Driven Self-management in a Networked Environment
ADE, autonomic distributed environment, is a system which engages autonomic elements to automatically take an existing centralized application and distribute it across available re...
Debzani Deb, M. Muztaba Fuad, Michael J. Oudshoorn
TSMC
2008
134views more  TSMC 2008»
13 years 9 months ago
Expanding the Criteria for Evaluating Socio-Technical Software
Abstract--This paper compares two evaluation criterion frameworks for sociotechnical software. Research on the technology acceptance model (TAM) confirms that perceived usefulness ...
Brian Whitworth, Victor Bañuls, Cheickna Sy...
TSP
2008
98views more  TSP 2008»
13 years 9 months ago
Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
Roland Badeau, Gaël Richard, Bertrand David