Sciweavers

656 search results - page 60 / 132
» Large-Graph Layout Algorithms at Work: An Experimental Study
Sort
View
COMPGEOM
2006
ACM
15 years 1 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
IDEAS
2006
IEEE
98views Database» more  IDEAS 2006»
15 years 3 months ago
PAID: Mining Sequential Patterns by Passed Item Deduction in Large Databases
Sequential pattern mining is very important because it is the basis of many applications. Yet how to efficiently implement the mining is difficult due to the inherent characteri...
Zhenglu Yang, Masaru Kitsuregawa, Yitong Wang
SBCCI
2006
ACM
124views VLSI» more  SBCCI 2006»
15 years 3 months ago
A cryptography core tolerant to DFA fault attacks
This work describes a hardware approach for the concurrent fault detection and error correction in a cryptographic core. It has been shown in the literature that transient faults ...
Carlos Roberto Moratelli, Érika F. Cota, Ma...
PKDD
2004
Springer
118views Data Mining» more  PKDD 2004»
15 years 3 months ago
Mining Thick Skylines over Large Databases
Abstract. People recently are interested in a new operator, called skyline [3], which returns the objects that are not dominated by any other objects with regard to certain measure...
Wen Jin, Jiawei Han, Martin Ester
IMC
2009
ACM
15 years 4 months ago
An analysis of packet sampling in the frequency domain
Packet sampling techniques introduce measurement errors that should be carefully handled in order to correctly characterize the network behavior. In the literature several works h...
Luigi Alfredo Grieco, Chadi Barakat