1542 search results - page 197 / 309 » Kernelization of packing problems |
111
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
102
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
This paper considers the quantization problem on the Grassmann manifold Gn,p, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The ch...
110
Voted
CORR
2007
Springer
15 years 1 months ago
2007
Springer
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
120
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract--Dictionary-based string matching (DBSM) is a critical component of Deep Packet Inspection (DPI), where thousands of malicious patterns are matched against high-bandwidth ...
118
Voted
MOC
2002
15 years 1 months ago
2002
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...