Sciweavers

1527 search results - page 162 / 306
» What About Wednesday
Sort
View
TCS
2008
13 years 9 months ago
On the power of lookahead in on-line server routing problems
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci,...
JSA
2007
89views more  JSA 2007»
13 years 9 months ago
Robust codes and robust, fault-tolerant architectures of the Advanced Encryption Standard
— Hardware implementations of cryptographic algorithms are vulnerable to fault analysis attacks. Methods based on traditional fault-tolerant architectures are not suited for prot...
Konrad J. Kulikowski, Mark G. Karpovsky, Alexander...
CAS
2004
104views more  CAS 2004»
13 years 9 months ago
Why Model?
This lecture treats some enduring misconceptions about modeling. One of these is that the goal is always prediction. The lecture distinguishes between explanation and prediction a...
S. E. van der Leeuw
DATAMINE
2002
147views more  DATAMINE 2002»
13 years 9 months ago
Discretization: An Enabling Technique
Discrete values have important roles in data mining and knowledge discovery. They are about intervals of numbers which are more concise to represent and specify, easier to use and ...
Huan Liu, Farhad Hussain, Chew Lim Tan, Manoranjan...
ENTCS
2002
152views more  ENTCS 2002»
13 years 9 months ago
Abstract Logics as Dialgebras
Logics as Dialgebras Alessandra Palmigiano Departament de L`ogica, Hist`oria i Filosofia de la Ci`encia, Universitat de Barcelona The aim of this report is to propose a line of re...
Alessandra Palmigiano