Sciweavers

1871 search results - page 148 / 375
» The Ephemeral Pairing Problem
Sort
View
WWW
2007
ACM
16 years 11 days ago
Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography
In a social network, nodes correspond to people or other social entities, and edges correspond to social links between them. In an effort to preserve privacy, the practice of anon...
Lars Backstrom, Cynthia Dwork, Jon M. Kleinberg
CP
2009
Springer
16 years 10 days ago
Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...
Sophie Huczynska, Paul McKay, Ian Miguel, Peter Ni...
COCOON
2009
Springer
15 years 6 months ago
A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions
We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Akiyoshi Shioura, Mutsunori Yagiura
ISAAC
2009
Springer
78views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Reconstructing Polygons from Scanner Data
A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of poin...
Therese C. Biedl, Stephane Durocher, Jack Snoeyink
SARA
2009
Springer
15 years 6 months ago
Modelling Equidistant Frequency Permutation Arrays in Constraints
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
Ian P. Gent, Paul McKay, Ian Miguel, Peter Nightin...