2778 search results - page 271 / 556 » Limit complexities revisited |
159
click to vote
AIRS
2009
Springer
16 years 1 months ago
2009
Springer
Relevance-based language models operate by estimating the probabilities of observing words in documents relevant (or pseudo relevant) to a topic. However, these models assume that ...
155
click to vote
C5
2008
IEEE
16 years 1 months ago
2008
IEEE
End-user scripting languages are relatively easy to learn, but have limited expressive power. Tile-based scripting systems are particularly accessible to beginners, but usually ar...
160
click to vote
GROUP
2005
ACM
16 years 7 days ago
2005
ACM
Recent proliferation of computing devices has brought attention to heterogeneous collaborative systems, where key challenges arise from the resource limitations and disparities. S...
206
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
158
click to vote
ISCA
1995
IEEE
15 years 10 months ago
1995
IEEE
Speculative execution is execution of instructions before it is known whether these instructions should be executed. Compiler-based speculative execution has the potential to achi...