6976 search results - page 271 / 1396 » The Oil Searching Problem |
156
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
A heretofore unsolved problem of great archaeological importance is the automatic assembly of pots made on a wheel from the hundreds (or thousands) of sherds found at an excavatio...
192
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
175
click to vote
AIPS
2010
15 years 6 months ago
2010
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Sc...
190
click to vote
AICCSA
2007
IEEE
16 years 1 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
172
click to vote
JCDL
2005
ACM
16 years 6 days ago
2005
ACM
Constructing a Chinese digital library, especially for a historical article archiving, is often bothered by the small character sets supported by the current computer systems. Thi...