Sciweavers

4934 search results - page 967 / 987
» complexity 2008
Sort
View
CIKM
2008
Springer
15 years 1 months ago
Learning latent semantic relations from clickthrough data for query suggestion
For a given query raised by a specific user, the Query Suggestion technique aims to recommend relevant queries which potentially suit the information needs of that user. Due to th...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
CIKM
2008
Springer
15 years 1 months ago
Viability of in-house datamarting approaches for population genetics analysis of snp genotypes
Background: Databases containing very large amounts of SNP (Single Nucleotide Polymorphism) data are now freely available for researchers interested in medical and/or population g...
Jorge Amigo, Christopher Phillips, Antonio Salas
CLUSTER
2008
IEEE
15 years 1 months ago
Efficient one-copy MPI shared memory communication in Virtual Machines
Efficient intra-node shared memory communication is important for High Performance Computing (HPC), especially with the emergence of multi-core architectures. As clusters continue ...
Wei Huang, Matthew J. Koop, Dhabaleswar K. Panda
COMPGEOM
2008
ACM
15 years 1 months ago
Maximum thick paths in static and dynamic environments
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
Esther M. Arkin, Joseph S. B. Mitchell, Valentin P...
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 1 months ago
Intrinsically Universal Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Nicolas Ollinger