Sciweavers

15073 search results - page 400 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
CIE
2010
Springer
15 years 11 months ago
Ergodic-Type Characterizations of Algorithmic Randomness
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alex...
GBRPR
2007
Springer
16 years 1 months ago
Bipartite Graph Matching for Computing the Edit Distance of Graphs
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...
Kaspar Riesen, Michel Neuhaus, Horst Bunke
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
16 years 1 months ago
A study on metamodeling techniques, ensembles, and multi-surrogates in evolutionary computation
Surrogate-Assisted Memetic Algorithm(SAMA) is a hybrid evolutionary algorithm, particularly a memetic algorithm that employs surrogate models in the optimization search. Since mos...
Dudy Lim, Yew-Soon Ong, Yaochu Jin, Bernhard Sendh...
HPCC
2005
Springer
16 years 11 days ago
Exploring Regression for Mining User Moving Patterns in a Mobile Computing System
In this paper, by exploiting the log of call detail records, we present a solution procedure of mining user moving patterns in a mobile computing system. Specifically, we propose ...
Chih-Chieh Hung, Wen-Chih Peng, Jiun-Long Huang
ISCC
2002
IEEE
131views Communications» more  ISCC 2002»
15 years 11 months ago
Scheduling real time parallel structure on cluster computing
: - Efficient task scheduling is essential for achieving high performance computing applications for distributed systems. Most of existing real-time systems consider schedulability...
Reda A. Ammar, Abdulrahman Alhamdan