2107 search results - page 62 / 422 » Computing Small Search Numbers in Linear Time |
115
Voted
COMPGEOM
2005
ACM
15 years 4 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
120
Voted
AAAI
1996
15 years 4 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
112
Voted
ACCV
2009
Springer
15 years 9 months ago
2009
Springer
Learning based super-resolution can recover high resolution image with high quality. However, building an interactive learning based super-resolution system for general images is e...
121
Voted
CCGRID
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper addresses the query performance issue for Relational OLAP (ROLAP) datacubes. We present a distributed multi-dimensional ROLAP indexing scheme which is practical to imple...
140
Voted
TCS
2012
13 years 10 months ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...