Sciweavers

935 search results - page 69 / 187
» Some Results on Orthogonal Factorizations
Sort
View
EPIA
2003
Springer
15 years 3 months ago
Using CLIPS to Detect Network Intrusions
We describe how to build a network intrusion detection sensor by slightly modifying NASA’s CLIPS source code introducing some new features. An overview of the system is presente...
Pedro Alípio, Paulo Carvalho, José N...
SODA
2003
ACM
102views Algorithms» more  SODA 2003»
14 years 11 months ago
Online paging with arbitrary associativity
We tackle the problem of online paging on two level memories with arbitrary associativity (including victim caches, skewed caches etc.). We show that some important classes of pag...
Enoch Peserico
IWOCA
2009
Springer
149views Algorithms» more  IWOCA 2009»
15 years 4 months ago
Randomized Postoptimization of Covering Arrays
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
Peyman Nayeri, Charles J. Colbourn, Goran Konjevod
TCS
2008
14 years 10 months ago
On different generalizations of episturmian words
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
15 years 10 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky