8512 search results - page 318 / 1703 » Computing Theory With Relevance |
349
click to vote
SIGIR
2012
ACM
13 years 9 months ago
2012
ACM
People are seldom aware that their search queries frequently mismatch a majority of the relevant documents. This may not be a big problem for topics with a large and diverse set o...
160
click to vote
MFCS
1990
Springer
15 years 10 months ago
1990
Springer
The plausibility of computing the answers to many membership queries to a hard set with few queries is the subject of the theory of terseness. In this paper, we develop companion ...
160
click to vote
ISMB
1996
15 years 8 months ago
1996
A novel theory of subtractive hybridization including (or based on) the kinetic model of this process was proposed. A computer program modeling the process of subtraction wasdevel...
131
click to vote
MOC
2000
15 years 6 months ago
2000
Resolutions of cusp singularities are crucial to many techniques in computational number theory, and therefore finding explicit resolutions of these singularities has been the focu...
203
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...