Sciweavers

1068 search results - page 44 / 214
» Factorization as a Rank 1 Problem
Sort
View
IPL
2006
88views more  IPL 2006»
14 years 9 months ago
On Quickselect, partial sorting and Multiple Quickselect
We present explicit solutions of a class of recurrences related to the Quickselect algorithm. Thus we are immediately able to solve recurrences arising at the partial sorting probl...
Markus Kuba
EMNLP
2008
14 years 11 months ago
Relative Rank Statistics for Dialog Analysis
We introduce the relative rank differential statistic which is a non-parametric approach to document and dialog analysis based on word frequency rank-statistics. We also present a...
Juan Huerta
ICDE
2009
IEEE
194views Database» more  ICDE 2009»
15 years 11 months ago
Effective XML Keyword Search with Relevance Oriented Ranking
Abstract-- Inspired by the great success of information retrieval (IR) style keyword search on the web, keyword search on XML has emerged recently. The difference between text data...
Zhifeng Bao, Tok Wang Ling, Bo Chen, Jiaheng Lu
JDA
2010
88views more  JDA 2010»
14 years 8 months ago
Greedy colorings for the binary paintshop problem
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
Hadis Amini, Frédéric Meunier, H&eac...
NIPS
2004
14 years 11 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg