2412 search results - page 462 / 483 » Which Problems Have Strongly Exponential Complexity |
SIGGRAPH
1998
ACM
13 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...
WG
1998
Springer
13 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...
SIGMOD
1994
ACM
13 years 11 months ago
1994
ACM
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended...
FLAIRS
2007
13 years 9 months ago
2007
The basic aim of the model proposed here is to automatically build semantic metatext structure for texts that would allow us to search and extract discourse and semantic informati...
DAGSTUHL
2007
13 years 9 months ago
2007
Computational social choice is an interdisciplinary eld of study at the interface of social choice theory and computer science, with knowledge owing in either direction. On the o...