problem as a ranking problem and directly optimizes a listwise ranking function named Mean Reciprocal Rank (MRR), which is considered by us to be able to generate results closest to human expec-tations. Using a maximum-margin based structured learn-ing model, we are able to show improved re-identification

-period alternating offer, and dictator games; games where reciprocity is thought to play a role, such as the prisoner’s dilemma and the gift exchange game; and games where competitive behavior is observed, such as Bertrand and Cournot markets, and the guessing game.

In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search

, purpose in life, and personal growth) were operationalized. Three hundred and twenty-one men and women, divided among young, middle-aged, and older adults, rated themselves on these measures along with six instruments prominent in earlier studies (i.e., affect balance, life satisfaction, self

Abstruct- A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a

Abstract not found

average for posi-tive events and below average for negative events, ps<.001. Cognitive and motivational considerations led to predictions that degree of desirability, per-ceived probability, personal experience, perceived controllability, and stereotype salience would influence the amount of optimistic

boosting algorithm for combining preferences called RankBoost. We also describe an efficient implementation of the algorithm for certain natural cases. We discuss two experiments we carried out to assess the performance of RankBoost. In the first experiment, we used the algorithm to combine different WWW

This paper considers a number of selection schemes commonly used in modern genetic algorithms. Specifically, proportionate reproduction, ranking selection, tournament selection, and Genitor (or «steady state&quot;) selection are compared on the basis of solutions to deterministic difference

Assuming that numerical scores are available for the performance of each of n persons on each of n jobs, the "assignment problem" is the quest for an assignment of persons to jobs so that the sum of the n scores so obtained is as large as possible. It is shown that ideas latent