1653 search results - page 291 / 331 » Directed tree-width examples |
102
click to vote
VLDB
2001
ACM
15 years 6 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
107
click to vote
VISUALIZATION
2000
IEEE
15 years 6 months ago
2000
IEEE
Visualization algorithms have seen substantial improvements in the past several years. However, very few algorithms have been developed for directly studying data in dimensions hi...
SIGGRAPH
2000
ACM
15 years 5 months ago
2000
ACM
Traditional collision intensive multi-body simulations are difficult to control due to extreme sensitivity to initial conditions or model parameters. Furthermore, there may be mu...
116
click to vote
SIGGRAPH
2000
ACM
15 years 5 months ago
2000
ACM
Many researchers have been arguing that geometry, bump maps, and BRDFs present a hierarchy of detail that should be exploited for efficient rendering purposes. In practice howeve...
146
click to vote
SPAA
1999
ACM
15 years 5 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...