2593 search results - page 381 / 519 » On Two Problems of Nano-PLA Design |
162
click to vote
KDD
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
137
click to vote
CHI
2007
ACM
16 years 6 months ago
2007
ACM
A study at a large IT company shows that mobile information workers frequently migrate work across devices (here: smartphones, desktop PCs, laptops). While having multiple devices...
158
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
166
click to vote
SIGMOD
2002
ACM
16 years 6 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
149
Voted
PODS
2007
ACM
16 years 6 months ago
2007
ACM
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...