6111 search results - page 149 / 1223 » Time, Hardware, and Uniformity |
111
click to vote
SPAA
2005
ACM
15 years 6 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
106
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
The subset sum problem (SSP) (given n numbers and a target bound B, find a subset of the numbers summing to B), is one of the classical NP-hard problems. The hardness of SSP vari...
110
Voted
SDM
2007
SIAM
15 years 2 months ago
2007
SIAM
Time series are difficult to monitor, summarize and predict. Segmentation organizes time series into few intervals having uniform characteristics (flatness, linearity, modality,...
124
Voted
JCSS
2000
15 years 17 days ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
128
Voted
EWSN
2007
Springer
16 years 11 days ago
2007
Springer
Duty-cycling in wireless sensor networks (WSNs) has both beneficial effects on network lifetime and negative effects on application performance due to the inability of a sensor to ...