Sciweavers

5138 search results - page 172 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
SODA
1993
ACM
85views Algorithms» more  SODA 1993»
15 years 7 months ago
On Traversing Layered Graphs On-line
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
H. Ramesh
CIKM
2009
Springer
16 years 1 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
IROS
2008
IEEE
108views Robotics» more  IROS 2008»
16 years 24 days ago
A random set formulation for Bayesian SLAM
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
John Mullane, Ba-Ngu Vo, Martin David Adams, Wijer...
SAC
2003
ACM
15 years 11 months ago
A Markov Random Field Model of Microarray Gridding
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...
Mathias Katzer, Franz Kummert, Gerhard Sagerer
WEA
2005
Springer
138views Algorithms» more  WEA 2005»
15 years 12 months ago
A Practical Minimal Perfect Hashing Method
We propose a novel algorithm based on random graphs to construct minimal perfect hash functions h. For a set of n keys, our algorithm outputs h in expected time O(n). The evaluatio...
Fabiano C. Botelho, Yoshiharu Kohayakawa, Nivio Zi...