Sciweavers

469 search results - page 91 / 94
» Directed Graphs of Entanglement Two
Sort
View
98
Voted
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
15 years 4 months ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
129
Voted
SPAA
1999
ACM
15 years 4 months ago
Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, A...
114
Voted
HYBRID
1998
Springer
15 years 3 months ago
Formal Verification of Safety-Critical Hybrid Systems
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
Carolos Livadas, Nancy A. Lynch
KDD
2010
ACM
252views Data Mining» more  KDD 2010»
15 years 3 months ago
Fast query execution for retrieval models based on path-constrained random walks
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
Ni Lao, William W. Cohen
AAAI
2006
15 years 1 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer