1161 search results - page 98 / 233 » Kinetic Dependence Graphs |
150
click to vote
COGSCI
2010
15 years 5 months ago
2010
We used a new method to assess how people can infer unobserved causal structure from patterns of observed events. Participants were taught to draw causal graphs, and then shown a ...
162
click to vote
SIGARCH
2008
15 years 5 months ago
2008
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
146
click to vote
VLDB
1994
ACM
15 years 9 months ago
1994
ACM
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
143
click to vote
PODS
2006
ACM
16 years 5 months ago
2006
ACM
Given that most elementary problems in database design are NP-hard, the currently used database design algorithms produce suboptimal results. For example, the current 3NF decompos...
179
click to vote
STACS
2010
Springer
16 years 7 days ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...