Sciweavers

1675 search results - page 264 / 335
» Implementing Data Cubes Efficiently
Sort
View
KDD
2002
ACM
166views Data Mining» more  KDD 2002»
14 years 10 months ago
Exploiting response models: optimizing cross-sell and up-sell opportunities in banking
The banking industry regularly mounts campaigns to improve customer value by offering new products to existing customers. In recent years this approach has gained significant mome...
Andrew Storey, Marc-David Cohen
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
14 years 2 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
COMPGEOM
2006
ACM
14 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
BMCBI
2006
121views more  BMCBI 2006»
13 years 10 months ago
Splice site identification using probabilistic parameters and SVM classification
Background: Recent advances and automation in DNA sequencing technology has created a vast amount of DNA sequence data. This increasing growth of sequence data demands better and ...
A. K. M. A. Baten, Bill C. H. Chang, Saman K. Halg...
MICRO
2006
IEEE
191views Hardware» more  MICRO 2006»
13 years 10 months ago
CAPSULE: Hardware-Assisted Parallel Execution of Component-Based Programs
Since processor performance scalability will now mostly be achieved through thread-level parallelism, there is a strong incentive to parallelize a broad range of applications, inc...
Pierre Palatin, Yves Lhuillier, Olivier Temam