Sciweavers

4488 search results - page 13 / 898
» Properties of NP-Complete Sets
Sort
View
CVPR
2011
IEEE
13 years 3 months ago
Multiobject Tracking as Maximum Weight Independent Set
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
William Brendel, Mohamed Amer, Sinisa Todorovic
IACR
2011
84views more  IACR 2011»
12 years 7 months ago
Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
In this paper, we explore a general methodology for converting composite order pairingbased cryptosystems into the prime order setting. We employ the dual pairing vector space app...
Allison B. Lewko
SODA
2004
ACM
108views Algorithms» more  SODA 2004»
13 years 9 months ago
A certifying algorithm for the consecutive-ones property
We give a forbidden substructure characterization of set families that have the consecutive-ones property, and a linear time algorithm to find the forbidden substructure if a set ...
Ross M. McConnell
COCO
2004
Springer
106views Algorithms» more  COCO 2004»
14 years 1 months ago
Separating Complexity Classes Using Structural Properties
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
Harry Buhrman, Leen Torenvliet
BSL
2011
13 years 2 months ago
Combinatorial dichotomies in set theory
show that an abstract analysis of one of these three set theoretic principles can sometimes lead us to results that do not require additional axioms at all but which could have bee...
Stevo Todorcevic