Sciweavers

2100 search results - page 380 / 420
» Learning to rank on graphs
Sort
View
AAAI
2010
15 years 3 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer
62
Voted
CORR
2010
Springer
44views Education» more  CORR 2010»
15 years 2 months ago
Evolution of National Nobel Prize Shares in the 20th Century
We analyze the evolution of cumulative national shares of Nobel Prizes since 1901, properly taking into account that most prizes were divided among several laureates. We rank by c...
Jürgen Schmidhuber
TCBB
2008
117views more  TCBB 2008»
15 years 1 months ago
Consensus Genetic Maps as Median Orders from Inconsistent Sources
A genetic map is an ordering of genetic markers calculated from a population of known lineage. Although, traditionally, a map has been generated from a single population for each s...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
TOPLAS
2008
81views more  TOPLAS 2008»
15 years 1 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
JSS
2007
121views more  JSS 2007»
15 years 1 months ago
Opportunistic prioritised clustering framework for improving OODBMS performance
In object oriented database management systems, clustering has proven to be one of the most effective performance enhancement techniques. Existing clustering algorithms are mainly...
Zhen He, Richard Lai, Alonso Marquez, Stephen Blac...