9842 search results - page 1507 / 1969 » The Complexity of the Matching-Cut Problem |
173
click to vote
SIGGRAPH
1998
ACM
15 years 11 months ago
1998
ACM
Modeling and rendering of natural scenes with thousands of plants poses a number of problems. The terrain must be modeled and plants must be distributed throughout it in a realist...
182
click to vote
SIGIR
1998
ACM
15 years 11 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....
204
click to vote
HPCN
1998
Springer
15 years 11 months ago
1998
Springer
We describe the Paraflow system for connecting heterogeneous computing services together into a flexible and efficient data-mining metacomputer. There are three levels of parallel...
265
click to vote
VLDB
1998
ACM
15 years 11 months ago
1998
ACM
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
192
click to vote
WG
1998
Springer
15 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...