1716 search results - page 273 / 344 » Proving Conditional Termination |
119
Voted
STOC
1992
ACM
15 years 4 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
99
Voted
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper describes a deterministic approach to adaptive state and parameter estimation using a multiple model structure. In the set-up adopted, the plant of interest is described...
109
click to vote
CSFW
2010
IEEE
15 years 4 months ago
2010
IEEE
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
100
click to vote
KDD
2010
ACM
15 years 4 months ago
2010
ACM
We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
113
Voted
ICCCN
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract-- Elastic applications are primarily interested in minimal delay achievable for their messages under current network load. In this paper, we investigate how to transmit su...