Sciweavers

4110 search results - page 35 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
141
Voted
ICDT
2007
ACM
74views Database» more  ICDT 2007»
15 years 7 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
133
Voted
VLDB
1995
ACM
163views Database» more  VLDB 1995»
15 years 7 months ago
An Efficient Algorithm for Mining Association Rules in Large Databases
Mining for a.ssociation rules between items in a large database of sales transactions has been described as an important database mining problem. In this paper we present an effic...
Ashok Savasere, Edward Omiecinski, Shamkant B. Nav...
148
Voted
ENC
2004
IEEE
15 years 7 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
126
Voted
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 7 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
111
Voted
CSC
2006
15 years 5 months ago
Developing Efficient Option Pricing Algorithms by Combinatorial Techniques
How to price options efficiently and accurately is an important research problem. Options can be priced by the lattice model. Although the pricing results converge to the theoreti...
Tian-Shyr Dai, Yuh-Dauh Lyuu, Li-min Liu