Sciweavers

730 search results - page 131 / 146
» Combinatorics of Monotone Computations
Sort
View
DLT
2007
13 years 9 months ago
Two Element Unavoidable Sets of Partial Words
d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...
Francine Blanchet-Sadri, N. C. Brownstein, Justin ...
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
14 years 8 months ago
Efficient closed pattern mining in the presence of tough block constraints
In recent years, various constrained frequent pattern mining problem formulations and associated algorithms have been developed that enable the user to specify various itemsetbase...
Krishna Gade, Jianyong Wang, George Karypis
CISS
2007
IEEE
14 years 1 months ago
Differential Space-Frequency Group Codes for MIMO-OFDM
— In recent years, coherent space-frequency (SF) coded multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems have attracted great attentio...
Engin Zeydan, Ufuk Tureli
ANCS
2006
ACM
14 years 1 months ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...
FOCS
2005
IEEE
14 years 1 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira