598 search results - page 89 / 120 » A random graph model for massive graphs |
115
click to vote
ICST
2010
IEEE
14 years 10 months ago
2010
IEEE
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
336
click to vote
CPM
2011
Springer
14 years 3 months ago
2011
Springer
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
CRYPTO
2006
Springer
15 years 3 months ago
2006
Springer
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...
103
click to vote
CIVR
2010
Springer
15 years 2 months ago
2010
Springer
Most existing reranking approaches to image search focus solely on mining "visual" cues within the initial search results. However, the visual information cannot always ...
COLT
2007
Springer
15 years 6 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...