34 search results - page 6 / 7 » New Generic Algorithms for Hard Knapsacks |
PODS
2008
ACM
15 years 9 months ago
2008
ACM
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
PODS
2010
ACM
15 years 2 months ago
2010
ACM
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
87
Voted
TDSC
2010
14 years 8 months ago
2010
—We propose SigFree, an online signature-free out-of-the-box application-layer method for blocking code-injection buffer overflow attack messages targeting at various Internet se...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
125
click to vote
CIVR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, a motion-based approach for detecting highlevel semantic events in video sequences is presented. Its main characteristic is its generic nature, i.e. it can be direc...