Sciweavers

178 search results - page 7 / 36
» An Analysis of (Linear) Exponentials Based on Extended Seque...
Sort
View
SP
1996
IEEE
101views Security Privacy» more  SP 1996»
13 years 11 months ago
An Immunological Approach to Change Detection: Algorithms, Analysis and Implications
We present new results on a distributable changedetection method inspired by the natural immune system. A weakness in the original algorithm was the exponential cost of generating...
Patrik D'haeseleer, Stephanie Forrest, Paul Helman
CADE
2008
Springer
14 years 8 months ago
Automated Complexity Analysis Based on the Dependency Pair Method
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
Nao Hirokawa, Georg Moser
TSP
2008
114views more  TSP 2008»
13 years 7 months ago
Universal Switching Linear Least Squares Prediction
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
Suleyman Serdar Kozat, Andrew C. Singer
GLOBECOM
2008
IEEE
14 years 2 months ago
Global Optimal Routing, Scheduling and Power Control for Multi-Hop Wireless Networks with Interference
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...
Javad Kazemitabar, Vahid Tabatabaee, Hamid Jafarkh...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle