Sciweavers

2745 search results - page 166 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
TMC
2011
127views more  TMC 2011»
14 years 11 months ago
Discriminant Minimization Search for Large-Scale RF-Based Localization Systems
— In large-scale fingerprinting localization systems, fine-grained location estimation and quick location determination are conflicting concerns. To achieve finer-grained loc...
Sheng-Po Kuo, Yu-Chee Tseng
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 7 months ago
Evolving hash functions by means of genetic programming
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
César Estébanez, Julio César ...
132
Voted
ICPP
1999
IEEE
15 years 8 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
BMCBI
2008
102views more  BMCBI 2008»
15 years 4 months ago
Fast splice site detection using information content and feature reduction
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
135
Voted
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 2 months ago
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
Konstantin Avrachenkov, Nelly Litvak, Danil Nemiro...