5055 search results - page 141 / 1011 » Relative Timing |
129
click to vote
NIPS
1998
15 years 6 months ago
1998
A common way to represent a time series is to divide it into shortduration blocks, each of which is then represented by a set of basis functions. A limitation of this approach, ho...
167
Voted
SENSYS
2010
ACM
15 years 2 months ago
2010
ACM
To achieve more accurate global time synchronization, this paper argues for decoupling the clock distribution network from the routing tree in a multihop wireless network. We find...
136
Voted
CORR
2010
Springer
15 years 1 days ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
130
click to vote
CHI
2008
ACM
16 years 5 months ago
2008
ACM
The way we experience and evaluate interactive products develops over time. An exploratory study aimed at understanding how users form evaluative judgments during the first experi...
147
Voted
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...