4488 search results - page 363 / 898 » Focusing Search by Using Problem Solving Experience |
137
click to vote
SIGIR
1998
ACM
15 years 9 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
140
click to vote
ICMCS
2006
IEEE
15 years 11 months ago
2006
IEEE
This paper presents a new spatial-HMM(SHMM)for automatically classifying and annotating natural images. Our model is a 2D generalization of the traditional HMM in the sense that b...
192
click to vote
PKDD
2004
Springer
15 years 10 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
151
click to vote
SIGIR
2010
ACM
15 years 9 months ago
2010
ACM
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
166
click to vote
DATE
2004
IEEE
15 years 8 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...