Sciweavers

1441 search results - page 58 / 289
» Multiple instance ranking
Sort
View
CORR
2008
Springer
85views Education» more  CORR 2008»
13 years 10 months ago
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. ranki...
Paul Tarau
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 10 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
FSTTCS
2008
Springer
13 years 11 months ago
Dynamic matrix rank with partial lookahead
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
Telikepalli Kavitha
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 9 months ago
Separable and Low-Rank Continuous Games
— Separable games are a structured subclass of continuous games whose payoffs take a sum-of-products form; the zero-sum case has been studied in earlier work. Included in this su...
Noah D. Stein, Asuman E. Ozdaglar, Pablo A. Parril...
WWW
2006
ACM
14 years 10 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing