Sciweavers

6300 search results - page 210 / 1260
» We have it easy, but do we have it right
Sort
View
COR
2007
112views more  COR 2007»
15 years 1 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...
IJON
2006
66views more  IJON 2006»
15 years 1 months ago
The interaction between facilitation and depression of two release mechanisms in a single synapse
The synapse from the lateral pyloric (LP) to the pyloric dilator (PD) neuron in the stomatogastric nervous system of the crab Cancer borealis has both a graded and a spike-mediate...
Lian Zhou, Robert LoMauro, Farzan Nadim
DKE
2007
111views more  DKE 2007»
15 years 1 months ago
Category ranking for personalized search
Despite the effectiveness of search engines, the persistently increasing amount of web data continuously obscures the search task. Efforts have thus concentrated on personalized...
Christos Makris, Yannis Panagis, Evangelos Sakkopo...
117
Voted
ESWA
2007
117views more  ESWA 2007»
15 years 1 months ago
An HMM for detecting spam mail
Hidden Markov Models, or HMMs for short, have been recently used in Bioinformatics for the classification of DNA or protein chains, giving rise to what is known as Profile Hidde...
José Gordillo, Eduardo Conde
PR
2006
132views more  PR 2006»
15 years 1 months ago
Some approaches to improve tree-based nearest neighbour search algorithms
Nearest neighbour search is a widely used technique in pattern recognition. During the last three decades a large number of fast algorithms have been proposed. In this work we are...
Eva Gómez-Ballester, Luisa Micó, Jos...