Sciweavers

1972 search results - page 277 / 395
» connection 2008
Sort
View
PVLDB
2008
146views more  PVLDB 2008»
15 years 5 months ago
Resisting structural re-identification in anonymized social networks
We identify privacy risks associated with releasing network data sets and provide an algorithm that mitigates those risks. A network consists of entities connected by links repres...
Michael Hay, Gerome Miklau, David Jensen, Donald F...
TIP
2008
167views more  TIP 2008»
15 years 5 months ago
FIR Filter Banks for Hexagonal Data Processing
Images are conventionally sampled on a rectangular lattice, and they are also commonly stored as such a lattice. Thus, traditional image processing is carried out on the rectangula...
Q. Jiang
TVCG
2008
169views more  TVCG 2008»
15 years 5 months ago
Adaptive Geometry Image
We present a novel postprocessing utility called adaptive geometry image (AGIM) for global parameterization techniques that can embed a 3D surface onto a rectangular1 domain. This ...
Chih-Yuan Yao, Tong-Yee Lee
JMIV
2008
97views more  JMIV 2008»
15 years 6 months ago
Fusion Graphs: Merging Properties and Watersheds
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...
Jean Cousty, Gilles Bertrand, Michel Couprie, Laur...
DM
2008
77views more  DM 2008»
15 years 5 months ago
Perfect Skolem sets
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
Gustav Nordh