16616 search results - page 2924 / 3324 » Extending Extended Vacuity |
196
click to vote
COMPSAC
2009
IEEE
16 years 1 months ago
2009
IEEE
As computing technology becomes increasingly pervasive and interconnected, mobility leads to shorter-lasting relationships between end-points with many different security requirem...
161
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Group-Centric Secure Information Sharing (g-SIS) is motivated by the need to dynamically share information amongst a set of authorized users for a specific purpose. Authorized ...
177
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
180
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
198
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...