6251 search results - page 1106 / 1251 » Randomness, Computability, and Density |
113
click to vote
SIGIR
2002
ACM
15 years 3 months ago
2002
ACM
We develop a method for predicting query performance by computing the relative entropy between a query language model and the corresponding collection language model. The resultin...
135
click to vote
TCS
2002
15 years 3 months ago
2002
In a heap model, solid blocks, or pieces, pile up according to the Tetris game mechanism. An optimal schedule is an in nite sequence of pieces minimizing the asymptotic growth rat...
148
click to vote
TOG
2002
15 years 3 months ago
2002
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
134
click to vote
TSMC
2002
15 years 3 months ago
2002
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
161
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract—In this contribution, the performance of a multiuser system is analyzed in the context of frequency selective fading channels. Using game theoretic tools, a useful frame...