Sciweavers

3268 search results - page 456 / 654
» The hub number of a graph
Sort
View
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
AAAI
2007
15 years 8 months ago
The Impact of Network Topology on Pure Nash Equilibria in Graphical Games
Graphical games capture some of the key aspects relevant to the study and design of multi-agent systems. It is often of interest to find the conditions under which a game is stab...
Bistra N. Dilkina, Carla P. Gomes, Ashish Sabharwa...
DEXA
2008
Springer
87views Database» more  DEXA 2008»
15 years 8 months ago
Tracking Moving Objects in Anonymized Trajectories
Multiple target tracking (MTT) is a well-studied technique in the field of radar technology, which associates anonymized measurements with the appropriate object trajectories. This...
Nikolay Vyahhi, Spiridon Bakiras, Panos Kalnis, Ga...
CSREASAM
2006
15 years 8 months ago
A Visual Environment for Characterization of State Changes in Computer Systems
: Traditional state modeling techniques have several limitations. One of these is the reduced ability to model a large number of variables simultaneously. Another limitation is tha...
Gregory Vert, Sergiu M. Dascalu, Frederick C. Harr...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 7 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler