8825 search results - page 1393 / 1765 » All for one or one for all |
101
click to vote
STOC
2003
ACM
16 years 1 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
116
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
128
click to vote
C5
2003
IEEE
15 years 6 months ago
2003
IEEE
SuperSwiki is a not yet well defined term. Its origins go back to Ward Cunningham's Wiki and its Squeak variant, the Swiki. It provides a place to share and edit web pages, f...
109
click to vote
CAV
2010
Springer
15 years 5 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
106
click to vote
SIGCOMM
2010
ACM
15 years 1 months ago
2010
ACM
Packet Classification is a key functionality provided by modern routers. Previous decision-tree algorithms, HiCuts and HyperCuts, cut the multi-dimensional rule space to separate ...