Sciweavers

976 search results - page 142 / 196
» The Complexity of Timetable Construction Problems
Sort
View
TAMC
2007
Springer
14 years 3 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
BMCBI
2010
150views more  BMCBI 2010»
13 years 9 months ago
Systematic calibration of a cell signaling network model
Background: Mathematical modeling is being applied to increasingly complex biological systems and datasets; however, the process of analyzing and calibrating against experimental ...
Kyoung Ae Kim, Sabrina L. Spencer, John G. Albeck,...
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 8 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
COMPGEOM
2011
ACM
13 years 13 days ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
CVPR
2007
IEEE
14 years 11 months ago
Autocalibration via Rank-Constrained Estimation of the Absolute Quadric
We present an autocalibration algorithm for upgrading a projective reconstruction to a metric reconstruction by estimating the absolute dual quadric. The algorithm enforces the ra...
Manmohan Krishna Chandraker, Sameer Agarwal, Fredr...