Sciweavers

8728 search results - page 1335 / 1746
» On Reduct Construction Algorithms
Sort
View
KDD
2003
ACM
152views Data Mining» more  KDD 2003»
16 years 7 months ago
Interactive exploration of coherent patterns in time-series gene expression data
Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we pr...
Daxin Jiang, Jian Pei, Aidong Zhang
POPL
2008
ACM
16 years 7 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
POPL
2003
ACM
16 years 7 months ago
Selective memoization
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
Umut A. Acar, Guy E. Blelloch, Robert Harper
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 7 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
16 years 7 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
« Prev « First page 1335 / 1746 Last » Next »