Sciweavers

1347 search results - page 48 / 270
» On the Structure of the Minimum Time Function
Sort
View
DDECS
2008
IEEE
185views Hardware» more  DDECS 2008»
14 years 2 months ago
Fast Boolean Minimizer for Completely Specified Functions
: We propose a simple and fast two-level minimization algorithm for completely specified functions in this paper. The algorithm is based on processing ternary trees. A ternary tree...
Petr Fiser, Pemysl Rucký, Irena Vanov&aacut...
CVPR
2011
IEEE
13 years 3 months ago
Radiometric Calibration by Transform Invariant Low-rank Structure
We present a robust radiometric calibration method that capitalizes on the transform invariant low-rank structure of sensor irradiances recorded from a static scene with different...
Joon-Young Lee, Boxin Shi, Yasuyuki Matsushita, In...
ECAL
1995
Springer
13 years 11 months ago
Evolving Artificial Neural Networks that Develop in Time
Although recently there has been an increasing interest in studing genetically-based development using Artificial Life models, the mapping of the genetic information into the phen...
Stefano Nolfi, Domenico Parisi
ICCV
2007
IEEE
14 years 2 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
DAC
2004
ACM
14 years 8 months ago
Fast statistical timing analysis handling arbitrary delay correlations
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
Michael Orshansky, Arnab Bandyopadhyay