151 search results - page 20 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
143
click to vote
ICDE
2012
IEEE
13 years 6 months ago
2012
IEEE
— The advance of object tracking technologies leads to huge volumes of spatio-temporal data collected in the form of trajectory data stream. In this study, we investigate the pro...
149
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
136
Voted
GC
2007
Springer
15 years 3 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
143
Voted
SIROCCO
2007
15 years 5 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
178
click to vote
JMLR
2010
14 years 10 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...