Sciweavers

101 search results - page 9 / 21
» An Algorithm to Find a Perfect Map for Graphoid Structures
Sort
View
IWCIA
2009
Springer
14 years 3 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
AVI
2004
13 years 10 months ago
Smooth Morphing of Handwritten Text
There are several approaches for pen-based systems to improve legibility of handwritten text, e.g. smoothing the strokes composing the characters and words. A very challenging sol...
Conrad Pomm, Sven Werlen
PVLDB
2008
116views more  PVLDB 2008»
13 years 8 months ago
Anonymizing bipartite graph data using safe groupings
Private data often comes in the form of associations between entities, such as customers and products bought from a pharmacy, which are naturally represented in the form of a larg...
Graham Cormode, Divesh Srivastava, Ting Yu, Qing Z...
ACTA
2008
136views more  ACTA 2008»
13 years 8 months ago
Two-dimensional packing with conflicts
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
Leah Epstein, Asaf Levin, Rob van Stee
INFOCOM
2006
IEEE
14 years 2 months ago
The Internet Dark Matter - on the Missing Links in the AS Connectivity Map
Abstract— The topological structure of the Internet infrastructure is an important and interesting subject that attracted significant research attention in the last few years. A...
Rami Cohen, Danny Raz