Sciweavers

537 search results - page 53 / 108
» A new upper bound for 3-SAT
Sort
View
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 1 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
FSTTCS
2006
Springer
15 years 1 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh
ICRA
2008
IEEE
131views Robotics» more  ICRA 2008»
15 years 4 months ago
Target assignment for integrated search and tracking by active robot networks
Abstract—This paper presents a new task assignment algorithm that integrates area search and target tracking. A new tracking metric is derived that encodes the ability of each ro...
Eric W. Frew, Jack Elston
STACS
1999
Springer
15 years 2 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
ECCC
2010
143views more  ECCC 2010»
14 years 7 months ago
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
Derrick Stolee, N. V. Vinodchandran