Sciweavers

8824 search results - page 70 / 1765
» On the Complexity of Real Functions
Sort
View
JUCS
2008
122views more  JUCS 2008»
14 years 11 months ago
On the Subrecursive Computability of Several Famous Constants
: For any class F of total functions in the set N of the natural numbers, we define the notion of F-computable real number. A real number is called Fcomputable if there exist one-...
Dimiter Skordev
ISAAC
1993
Springer
149views Algorithms» more  ISAAC 1993»
15 years 4 months ago
The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams
A binary decision diagram (BDD) is a directed acyclic graph for representing a Boolean function. BDD’s are widely used in various areas which require Boolean function manipulatio...
Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima
ICCV
2007
IEEE
16 years 1 months ago
3D object recognition from range images using pyramid matching
Recognition of 3D objects from different viewpoints is a difficult problem. In this paper, we propose a new method to recognize 3D range images by matching local surface descripto...
Xinju Li, Igor Guskov
ICCV
2005
IEEE
15 years 5 months ago
How Hard is 3-View Triangulation Really?
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
Henrik Stewénius, Frederik Schaffalitzky, D...
AINA
2006
IEEE
15 years 3 months ago
Towards an Unified Experimentation Framework for Protocol Engineering
The design and development process of complex systems require an adequate methodology and efficient instrumental support in order to early detect and correct anomalies in the func...
Laurent Dairaine, Ernesto Exposito, Herve Thalmens...