3600 search results - page 232 / 720 » The settling-time reducibility ordering |
269
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Keeping the test databases as small as possible leads to faster execution of tests and facilitates the task of completing the test cases and evaluating the actual outputs against ...
169
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we propose an approach that enables mobile clients to determine the validity of previous queries based on their current locations. In order to make this possible, th...
178
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Given the current trend towards application interoperability and XML-based data integration, there is an increasing need for XML interfaces to relational database management system...
177
click to vote
ICIAP
2007
ACM
16 years 6 months ago
2007
ACM
This paper proposes a novel technique for performing fast block matching for motion estimation which is optimal, meaning it yields the same results as a full-search investigation....
134
click to vote
ICSE
2003
IEEE-ACM
16 years 6 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...