2498 search results - page 400 / 500 » Data Structures with Unpredictable Timing |
216
click to vote
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
135
Voted
ICDM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—We describe a novel application of using data mining and statistical learning methods to automatically monitor and detect abnormal execution traces from console logs in ...
114
Voted
DEXA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
117
Voted
DASFAA
2008
IEEE
15 years 8 months ago
2008
IEEE
View updating is a long standing difficult problem. Given a view defined over base data sources and a view update, there are several different updates over the base data sources,...
124
click to vote
WEBDB
2005
Springer
15 years 7 months ago
2005
Springer
Recently, there has been increased interest in the retrieval and integration of hidden Web data with a view to leverage high-quality information available in online databases. Alt...