3008 search results - page 497 / 602 » Independence in connected graphs |
191
click to vote
WWW
2010
ACM
16 years 7 days ago
2010
ACM
Recent work on anonymizing online social networks (OSNs) has looked at privacy preserving techniques for publishing a single instance of the network. However, OSNs evolve and a si...
195
click to vote
COLT
2003
Springer
16 years 5 days ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
186
click to vote
ICSE
2001
IEEE-ACM
15 years 11 months ago
2001
IEEE-ACM
The paper addresses the formal specification, design and implementation of the behavioral component of graphical user interfaces. The complex sequences of visual events and action...
185
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
184
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...