Sciweavers

80 search results - page 11 / 16
» A simple local 3-approximation algorithm for vertex cover
Sort
View
IH
2009
Springer
14 years 2 months ago
Estimating Steganographic Fisher Information in Real Images
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
Andrew D. Ker
LOCA
2007
Springer
14 years 2 months ago
Localizing Tags Using Mobile Infrastructure
This paper presents algorithms, simulations, and empirical results of a system that finds relative tag positions in 3D space using a new approach called “mobile infrastructure....
Ying Zhang, Kurt Partridge, Jim Reich
CVGIP
2004
175views more  CVGIP 2004»
13 years 7 months ago
A subdivision-based deformable model for surface reconstruction of unknown topology
This paper presents a surface reconstruction algorithm that can recover correct shape geometry as well as its unknown topology from both volumetric images and unorganized point cl...
Ye Duan, Hong Qin
MFCS
2009
Springer
14 years 15 days ago
An Improved Approximation Bound for Spanning Star Forest and Color Saving
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
ICCV
2001
IEEE
14 years 9 months ago
A Novel Modeling Algorithm for Shape Recovery of Unknown Topology
This paper presents a novel modeling algorithm that is capable of simultaneously recovering correct shape geometry as well as its unknown topology from arbitrarily complicated dat...
Ye Duan, Hong Qin