3276 search results - page 465 / 656 » Data Management for Pervasive Computing |
91
Voted
POS
1998
Springer
15 years 3 months ago
1998
Springer
In light of advances in processor and networking technology, especially the emergence of network attached disks, the traditional client-server architecture becomes suboptimal for ...
101
click to vote
VLDB
1997
ACM
15 years 2 months ago
1997
ACM
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
IDA
2010
Springer
15 years 22 days ago
2010
Springer
This paper introduces a novel method for obtaining increased predictive performance from transparent models in situations where production input vectors are available when building...
PDPTA
2003
15 years 16 days ago
2003
Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-base...