4171 search results - page 365 / 835 » Choice numbers of graphs |
321
click to vote
ICDE
2008
IEEE
16 years 8 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...
197
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
214
click to vote
RECOMB
2007
Springer
16 years 7 months ago
2007
Springer
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
198
click to vote
RECOMB
2007
Springer
16 years 7 months ago
2007
Springer
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
166
click to vote
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...