Sciweavers

716 search results - page 56 / 144
» time 1997
Sort
View
78
Voted
IPPS
1997
IEEE
15 years 5 months ago
Lower Bounds on Systolic Gossip
Gossiping is an information dissemination process in which each processor has a distinct item of information and has to collect all the items possessed by the other processors. In...
Michele Flammini, Stephane Perennes
110
Voted
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
15 years 5 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
IOPADS
1997
94views more  IOPADS 1997»
15 years 2 months ago
Remote I/O Fast Access to Distant Storage
As high-speed networks make it easier to use distributed resources, it becomes increasingly common that applications and their data are not colocated. Users have traditionally add...
Ian T. Foster, David Kohr, Rakesh Krishnaiyer, Jac...
117
Voted
AAAI
1997
15 years 2 months ago
The "Inverse Hollywood Problem": From Video to Scripts and Storyboards via Causal Analysis
We address the problem of visually detecting causal events and tting them together into a coherent story of the action witnessed by the camera. We show that this can be done by re...
Matthew Brand
88
Voted
STACS
1997
Springer
15 years 5 months ago
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
Gerth Stølting Brodal