1322 search results - page 52 / 265 » Parameterized counting problems |
133
Voted
JCO
2010
15 years 1 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
142
Voted
INFOCOM
2010
IEEE
15 years 16 days ago
2010
IEEE
Radio Frequency IDentification (RFID) technology has attracted much attention due to its variety of applications, e.g., inventory control and object tracking. One important problem...
97
Voted
CANS
2008
Springer
15 years 4 months ago
2008
Springer
In the Crypto'07 paper [5], Desmedt et al. studied the problem of achieving secure n-party computation over nonAbelian groups. The function to be computed is fG(x1, . . . , x...
116
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
240
Voted
STOC
2012
ACM
13 years 5 months ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...