Sciweavers

8724 search results - page 247 / 1745
» Search result diversification
Sort
View
TIT
2008
107views more  TIT 2008»
15 years 6 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
BMCBI
2005
144views more  BMCBI 2005»
15 years 6 months ago
GeneRank: Using search engine technology for the analysis of microarray experiments
Background: Interpretation of simple microarray experiments is usually based on the fold-change of gene expression between a reference and a "treated" sample where the t...
Julie L. Morrison, Rainer Breitling, Desmond J. Hi...
ADVCS
2004
55views more  ADVCS 2004»
15 years 6 months ago
A Search Model of unemployment and Firm Dynamics
An urn-ball probabilistic model of the labor market is developed. Agents can be employed, (voluntary or involuntary) unemployed or entrepreneurs. The analytical long run equilibri...
Matteo Richiardi
SAC
2008
ACM
15 years 6 months ago
Extending peer-to-peer networks for approximate search
This paper proposes a way to enable approximate queries in a peer-to-peer network by using a special encoding function and error correcting codes. The encoding function maintains ...
Alain Mowat, Roman Schmidt, Michael Schumacher, Io...
WISE
2010
Springer
15 years 4 months ago
Identifying and Ranking Possible Semantic and Common Usage Categories of Search Engine Queries
In this paper, we propose a method for identifying and ranking possible categories of any user query based on the meanings and common usages of the terms and phrases within the que...
Reza Taghizadeh Hemayati, Weiyi Meng, Clement T. Y...