Sciweavers

1161 search results - page 23 / 233
» Kinetic Dependence Graphs
Sort
View
ACISP
1998
Springer
14 years 1 months ago
Detecting Key-Dependencies
The confidentiality of encrypted data depends on how well the key under which it was encrypted is maintained. If a session key was exchanged encrypted under a long-term key, exposu...
Tage Stabell-Kulø, Arne Helme, Gianluca Din...
NAACL
2010
13 years 7 months ago
Relaxed Marginal Inference and its Application to Dependency Parsing
Recently, relaxation approaches have been successfully used for MAP inference on NLP problems. In this work we show how to extend the relaxation approach to marginal inference use...
Sebastian Riedel, David A. Smith
WAW
2007
Springer
122views Algorithms» more  WAW 2007»
14 years 3 months ago
A Geometric Preferential Attachment Model of Networks II
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power-law degree distributio...
Abraham D. Flaxman, Alan M. Frieze, Juan Vera
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
14 years 10 months ago
Clairvoyant scheduling of random walks
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Péter Gács
GC
2007
Springer
13 years 9 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...