9209 search results - page 390 / 1842 » Data Space Randomization |
169
click to vote
ACSC
2001
IEEE
15 years 10 months ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
211
click to vote
ICFEM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. The success of industrial-scale model checkers such as Uppaal [3] or NuSMV [12] relies on the efficiency of their respective symbolic state space representations. While d...
152
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
201
click to vote
UAI
2004
15 years 8 months ago
2004
This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent cl...
179
Voted
MSS
2003
IEEE
16 years 1 days ago
2003
IEEE
Data grids federate storage resources. They provide a logical name space that can be used to register digital entities, a storage repository ion for manipulating data, and a high ...