Sciweavers

3775 search results - page 123 / 755
» The Expression Problem Revisited
Sort
View
142
Voted
BMCBI
2006
123views more  BMCBI 2006»
15 years 3 months ago
SBEAMS-Microarray: database software supporting genomic expression analyses for systems biology
Background: The biological information in genomic expression data can be understood, and computationally extracted, in the context of systems of interacting molecules. The automat...
Bruz Marzolf, Eric W. Deutsch, Patrick Moss, David...
ICCV
2007
IEEE
16 years 5 months ago
Accurate Non-Iterative O(n) Solution to the PnP Problem
We propose a non-iterative solution to the PnP problem--the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences--whose computational complexity gro...
Francesc Moreno-Noguer, Vincent Lepetit, Pascal Fu...
CHI
2009
ACM
15 years 8 months ago
The problem of consistency in the design of Fitts' law experiments: consider either target distance and width or movement form a
An intriguing anomaly of the usual way of designing Fitts’ law experiments in experimental psychology and HCI is exposed: experiments are traditionally designed so as to careful...
Yves Guiard
141
Voted
AI
2001
Springer
15 years 8 months ago
Search Techniques for Non-linear Constraint Satisfaction Problems with Inequalities
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
134
Voted
CP
1999
Springer
15 years 7 months ago
Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Claudio Lottaz