Sciweavers

991 search results - page 108 / 199
» The query-flow graph: model and applications
Sort
View
122
Voted
SPAA
2004
ACM
15 years 6 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
100
Voted
CIKM
2004
Springer
15 years 6 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
107
Voted
SIGCOMM
1998
ACM
15 years 4 months ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam
119
Voted
PPOPP
2009
ACM
16 years 1 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
HT
2003
ACM
15 years 5 months ago
HyperReal: a hypermedia model for mixed reality
This paper describes a generic hypermedia model that is used as a framework for building context aware and mixed reality applications. It can handle different media elements, and ...
Luís Romero, Nuno Correia