Sciweavers

2186 search results - page 241 / 438
» Considering an Organization's Memory
Sort
View
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
16 years 2 days ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
AMAST
2004
Springer
15 years 12 months ago
On Guard: Producing Run-Time Checks from Integrity Constraints
Abstract. Software applications are inevitably concerned with data integrity, whether the data is stored in a database, files, or program memory. An integrity guard is code execut...
Michael Benedikt, Glenn Bruns
IMR
2004
Springer
15 years 12 months ago
Non-Replicating Indexing for Out-Of-Core Processing of Semi-Regular Triangular Surface Meshes
We introduce an indexing scheme for the vertices of semi-regular meshes, based on interleaving quadtrees rooted on the edges of the base mesh. Using this indexing scheme we develo...
Igor Guskov
PARA
2004
Springer
15 years 12 months ago
Speeding up Parallel Graph Coloring
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woo...
AAECC
2003
Springer
116views Algorithms» more  AAECC 2003»
15 years 11 months ago
The Jacobi Model of an Elliptic Curve and Side-Channel Analysis
Abstract. A way for preventing SPA-like attacks on elliptic curve systems is to use the same formula for the doubling and the general addition of points on the curve. Various propo...
Olivier Billet, Marc Joye