Sciweavers

4112 search results - page 157 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
245
Voted
ICDE
2002
IEEE
138views Database» more  ICDE 2002»
16 years 6 months ago
Efficient Temporal Join Processing Using Indices
We examine the problem of processing temporal joins in the presence of indexing schemes. Previous work on temporal joins has concentrated on non-indexed relations which were fully...
Donghui Zhang, Vassilis J. Tsotras, Bernhard Seege...
140
Voted
KDD
1999
ACM
220views Data Mining» more  KDD 1999»
15 years 8 months ago
Efficient Mining of Emerging Patterns: Discovering Trends and Differences
We introduce a new kind of patterns, called emerging patterns (EPs), for knowledge discovery from databases. EPs are defined as itemsets whose supports increase significantly from...
Guozhu Dong, Jinyan Li
128
Voted
AAAI
1998
15 years 6 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
CCE
2004
15 years 4 months ago
Computational studies using a novel simplicial-approximation based algorithm for MINLP optimization
Significant advances have been made in the last two decades for the effective solution of mixed integer non-linear programming (MINLP) problems, mainly by exploiting the special s...
Vishal Goyal, Marianthi G. Ierapetritou
ICA
2010
Springer
15 years 2 months ago
Non-negative Independent Component Analysis Algorithm Based on 2D Givens Rotations and a Newton Optimization
Abstract. In this paper, we consider the Independent Component Analysis problem when the hidden sources are non-negative (Non-negative ICA). This problem is formulated as a non-lin...
Wendyam Serge Boris Ouedraogo, Antoine Souloumiac,...