Sciweavers

607 search results - page 89 / 122
» Unifying Exact Completions
Sort
View
81
Voted
IC
2003
15 years 9 days ago
Sampling Internet Topologies: How Small Can We Go?
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
Vaishnavi Krishnamurthy, Junhong Sun, Michalis Fal...
78
Voted
SSWMC
2004
15 years 9 days ago
Lossless data embedding with file size preservation
In lossless watermarking, it is possible to completely remove the embedding distortion from the watermarked image and recover an exact copy of the original unwatermarked image. Lo...
Jessica J. Fridrich, Miroslav Goljan, Qing Chen, V...
88
Voted
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
15 years 9 days ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
100
Voted
NIPS
1998
15 years 8 days ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller
AAAI
1996
15 years 8 days ago
Planning to Gather Information
We describe Occam, a query planning algorithm that determines the best way to integrate data from dierent sources. As input, Occam takes a library of site descriptions and a user ...
Chung T. Kwok, Daniel S. Weld