Sciweavers

3136 search results - page 614 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
DSN
2004
IEEE
15 years 3 months ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
DAWAK
2006
Springer
15 years 3 months ago
On the Computation of Maximal-Correlated Cuboids Cells
The main idea of iceberg data cubing methods relies on optimization techniques for computing only the cuboids cells above certain minimum support threshold. Even using such approac...
Ronnie Alves, Orlando Belo
FPGA
2006
ACM
195views FPGA» more  FPGA 2006»
15 years 3 months ago
An adaptive Reed-Solomon errors-and-erasures decoder
The development of Reed-Solomon (RS) codes has allowed for improved data transmission over a variety of communication media. Although Reed-Solomon decoding provides a powerful def...
Lilian Atieno, Jonathan Allen, Dennis Goeckel, Rus...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 3 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 3 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar