Sciweavers

2735 search results - page 228 / 547
» Comparing notions of randomness
Sort
View
CP
2009
Springer
14 years 11 months ago
Asynchronous Inter-Level Forward-Checking for DisCSPs
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
Redouane Ezzahir, Christian Bessiere, Mohamed Wahb...
RECOMB
2008
Springer
14 years 11 months ago
Algorithms for Exploring the Space of Gene Tree/Species Tree Reconciliations
We describe algorithms to explore the space of all possible reconciliations between a gene tree and a species tree. We propose an algorithm for generating a random reconciliation, ...
Jean-Philippe Doyon, Cedric Chauve, Sylvie Hamel
IEEEICCI
2008
IEEE
14 years 5 months ago
Improved offline signature verification scheme using feature point extraction method
In this paper a novel offline signature verification scheme has been proposed. The scheme is based on selecting 60 feature points from the geometric centre of the signature and co...
Debasish Jena, Banshidhar Majhi, Saroj Kumar Panig...
ICC
2007
IEEE
14 years 5 months ago
On the Capacity of Cellular Networks with Global LMMSE Receiver
Abstract— Frequency planning is a common intercell interference (ICI) management strategy in narrowband cellular networks. In this paper, we consider an alternative approach that...
Boon Loong Ng, Jamie S. Evans, Stephen V. Hanly
ICANN
2007
Springer
14 years 2 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel