Sciweavers

19320 search results - page 313 / 3864
» On the complexity of computing determinants
Sort
View
176
Voted
ICALP
2003
Springer
15 years 12 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
ICPR
2010
IEEE
15 years 12 months ago
Extracting Captions in Complex Background from Videos
—Captions in videos play a significant role for automatically understanding and indexing video content, since much semantic information is associated with them. This paper presen...
Xiaoqian Liu, Weiqiang Wang
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 10 months ago
The LEM3 implementation of learnable evolution model and its testing on complex function optimization problems
1 Learnable Evolution Model (LEM) is a form of non-Darwinian evolutionary computation that employs machine learning to guide evolutionary processes. Its main novelty are new type o...
Janusz Wojtusiak, Ryszard S. Michalski
ANSS
2007
IEEE
16 years 1 months ago
Failure Prediction in Computational Grids
Accurate failure prediction in Grids is critical for reasoning about QoS guarantees such as job completion time and availability. Statistical methods can be used but they suffer f...
Woochul Kang, Andrew S. Grimshaw
ICDM
2003
IEEE
126views Data Mining» more  ICDM 2003»
16 years 6 hour ago
Interpretations of Association Rules by Granular Computing
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association ...
Yuefeng Li, Ning Zhong