6110 search results - page 67 / 1222 » Approximate Computing |
106
click to vote
IJBC
2007
15 years 2 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
105
Voted
SIGGRAPH
1997
ACM
15 years 6 months ago
1997
ACM
We introduce a new class of primitive functions with non-linear parameters for representing light reflectance functions. The functions are reciprocal, energy-conserving and expres...
117
click to vote
IJFCS
2006
15 years 2 months ago
2006
We initiate a systematic study of the Row Deletion(B) problem on matrices: Given an input matrix A and a fixed "forbidden submatrix" B, the task is to remove a minimum n...
112
Voted
JAL
2007
15 years 2 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
ICDIM
2008
IEEE
15 years 9 months ago
2008
IEEE
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....