Sciweavers

518 search results - page 20 / 104
» Beating a Random Assignment
Sort
View
SIROCCO
2007
15 years 1 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten
CORR
2008
Springer
114views Education» more  CORR 2008»
14 years 11 months ago
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables
The LETOR website contains three information retrieval datasets used as a benchmark for testing machine learning ideas for ranking. Algorithms participating in the challenge are re...
Nir Ailon
ICALP
2005
Springer
15 years 5 months ago
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be...
Martin Dietzfelbinger, Christoph Weidling
TSMC
2008
133views more  TSMC 2008»
14 years 11 months ago
Trading With a Stock Chart Heuristic
Abstract--The efficient market hypothesis (EMH) is a cornerstone of financial economics. The EMH asserts that security prices fully reflect all available information and that the s...
William Leigh, Cheryl J. Frohlich, Steven Hornik, ...
ECIR
2007
Springer
15 years 1 months ago
Multinomial Randomness Models for Retrieval with Document Fields
Document fields, such as the title or the headings of a document, offer a way to consider the structure of documents for retrieval. Most of the proposed approaches in the literatu...
Vassilis Plachouras, Iadh Ounis