Sciweavers

778 search results - page 148 / 156
» Bounding Smooth Integers
Sort
View
ASIACRYPT
2003
Springer
14 years 23 days ago
Almost Uniform Density of Power Residues and the Provable Security of ESIGN
Abstract. ESIGN is an efficient signature scheme that has been proposed in the early nineties (see [14]). Recently, an effort was made to lay ESIGN on firm foundations, using the...
Tatsuaki Okamoto, Jacques Stern
ESSMAC
2003
Springer
14 years 23 days ago
Joint Optimization of Wireless Communication and Networked Control Systems
Abstract. We consider a linear system, such as an estimator or a controller, in which several signals are transmitted over wireless communication channels. With the coding and medi...
Lin Xiao, Mikael Johansson, Haitham A. Hindi, Step...
CPAIOR
2010
Springer
14 years 10 days ago
Solving Connected Subgraph Problems in Wildlife Conservation
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
Bistra N. Dilkina, Carla P. Gomes
CP
2001
Springer
14 years 1 days ago
Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. The local instruction scheduling problem is to nd a m...
Peter van Beek, Kent D. Wilken
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 12 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie