8933 search results - page 404 / 1787 » Usability over time |
192
click to vote
TIME
2006
IEEE
16 years 27 days ago
2006
IEEE
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are...
174
click to vote
ACMSE
2006
ACM
16 years 26 days ago
2006
ACM
Reconstructing networks from time series data is a difficult inverse problem. We apply two methods to this problem using co-temporal functions. Co-temporal functions capture mathe...
171
click to vote
DAC
1994
ACM
15 years 11 months ago
1994
ACM
Sequential place and route tools for FPGAs are inherently weak at addressing both wirability and timing optimizations. This is primarily due to the difficulty in predicting these ...
177
click to vote
DAWAK
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time up...
163
click to vote
ESA
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...