Sciweavers

9842 search results - page 540 / 1969
» Compositional timing analysis
Sort
View
INFOCOM
2005
IEEE
16 years 20 days ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
SPAA
1996
ACM
15 years 11 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 11 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
LCTRTS
2000
Springer
15 years 10 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
SDM
2010
SIAM
144views Data Mining» more  SDM 2010»
15 years 8 months ago
A Probabilistic Framework to Learn from Multiple Annotators with Time-Varying Accuracy
This paper addresses the challenging problem of learning from multiple annotators whose labeling accuracy (reliability) differs and varies over time. We propose a framework based ...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider