Sciweavers

2100 search results - page 77 / 420
» Fundamentals of the problem
Sort
View
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
14 years 10 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam
COMCOM
2002
143views more  COMCOM 2002»
13 years 10 months ago
Security architecture testing using IDS - a case study
Many security approaches are currently used in organisations. In spite of the widespread use of these security techniques, network intrusion remains a problem. This paper discusse...
Theuns Verwoerd, Ray Hunt
ICASSP
2009
IEEE
14 years 5 months ago
Expectation-maximization algorithm for multi-pitch estimation and separation of overlapping harmonic spectra
This paper addresses the problem of multi-pitch estimation, which consists in estimating the fundamental frequencies of multiple harmonic sources, with possibly overlapping partia...
Roland Badeau, Valentin Emiya, Bertrand David
FIMI
2004
239views Data Mining» more  FIMI 2004»
13 years 11 months ago
LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets
: For a transaction database, a frequent itemset is an itemset included in at least a specified number of transactions. A frequent itemset P is maximal if P is included in no other...
Takeaki Uno, Masashi Kiyomi, Hiroki Arimura
ASIAN
2004
Springer
109views Algorithms» more  ASIAN 2004»
14 years 3 months ago
Online Stochastic and Robust Optimization
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Russell Bent, Pascal Van Hentenryck