Sciweavers

2365 search results - page 16 / 473
» All things are connected
Sort
View
ACCV
1998
Springer
15 years 3 months ago
Minimal Conditions on Intrinsic Parameters for Euclidean Reconstruction
Abstract In this paper will be investigated what constraints on the intrinsic parameters that are needed in order to reconstruct an unknown scene from a number of its projective im...
Anders Heyden, Kalle Åström
IPCO
2004
114views Optimization» more  IPCO 2004»
15 years 21 days ago
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
IJWIN
2006
209views more  IJWIN 2006»
14 years 11 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
CORR
2007
Springer
116views Education» more  CORR 2007»
14 years 11 months ago
A presentation of Quantum Logic based on an "and then" connective
When a physicist performs a quantic measurement, new information about the system at hand is gathered. This presentation studies the logical properties of how this new information...
Daniel Lehmann
ESA
2006
Springer
112views Algorithms» more  ESA 2006»
15 years 3 months ago
Enumerating Spanning and Connected Subsets in Graphs and Matroids
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
Leonid Khachiyan, Endre Boros, Konrad Borys, Khale...