2379 search results - page 65 / 476 » Computer Science in the Information Age |
143
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
153
click to vote
ERSHOV
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. Two formal models for description of timing attacks are presented, studied and compared with other security concepts. The models are based on a timed process algebra and ...
193
click to vote
SOFSEM
2007
Springer
16 years 5 days ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
156
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
In property testing, we are given oracle access to a function f, and we wish to test if the function satisfies a given property P, or it is ε-far from having that property. In a...
177
click to vote
GI
2004
Springer
15 years 11 months ago
2004
Springer
: This paper addresses some classical problems to integrate data sources that are heterogeneous in structure with possibly redundant data along a real world example integrating thr...