Sciweavers

991 search results - page 134 / 199
» The query-flow graph: model and applications
Sort
View
WAOA
2004
Springer
107views Algorithms» more  WAOA 2004»
14 years 1 months ago
Order-Preserving Transformations and Greedy-Like Algorithms
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
Spyros Angelopoulos
ICCS
2007
Springer
13 years 11 months ago
A Dataflow-Oriented Atomicity and Provenance System for Pipelined Scientific Workflows
Scientific workflows have gained great momentum in recent years due to their critical roles in e-Science and cyberinfrastructure applications. However, some tasks of a scientific w...
Liqiang Wang, Shiyong Lu, Xubo Fei, Jeffrey L. Ram
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 9 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ATAL
2010
Springer
13 years 8 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
TVCG
2008
119views more  TVCG 2008»
13 years 7 months ago
Exploration of Networks using overview+detail with Constraint-based cooperative layout
A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node. The u...
Tim Dwyer, Kim Marriott, Falk Schreiber, Peter J. ...