Sciweavers

3008 search results - page 122 / 602
» Independence in connected graphs
Sort
View
FOCS
2007
IEEE
16 years 22 days ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
WWW
2004
ACM
16 years 7 months ago
Digital repository interoperability: design, implementation and deployment of the ecl protocol and connecting middleware
This paper describes the design and implementation of the eduSource Communication Layer (ECL) protocol. ECL is one outcome of a pan-Canadian project called eduSource Canada to bui...
Ty Mey Eap, Marek Hatala, Griff Richards
ADHOCNOW
2008
Springer
16 years 23 days ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov
CVPR
2010
IEEE
15 years 11 months ago
Exploiting Global Connectivity Constraints for Reconstruction of 3D Line Segments from Images
Given a set of 2D images, we propose a novel approach for the reconstruction of straight 3D line segments that represent the underlying geometry of static 3D objects in the scene....
Arjun Jain, Christian Kurz, Thorsten Thormaehlen, ...
ECCV
2006
Springer
15 years 10 months ago
Using a Connected Filter for Structure Estimation in Perspective Systems
Three-dimensional structure information can be estimated from two-dimensional images using recursive estimation methods. This paper investigates possibilities to improve structure...
Fredrik Nyberg, Ola Dahl, Jan Holst, Anders Heyden