544 search results - page 38 / 109 » What cannot be computed locally! |
SIGUCCS
2003
ACM
14 years 1 months ago
2003
ACM
Customers of public computing sites and faculty who use the public computer classrooms to teach want diversity in computing. Inevitably, there’s a group that does not want to te...
SDM
2009
SIAM
14 years 5 months ago
2009
SIAM
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
WIMOB
2008
IEEE
14 years 3 months ago
2008
IEEE
—We consider the rate allocation problem for data aggregation in wireless sensor networks with two objectives: 1) maximizing the lifetime of a local aggregation cluster and, 2) a...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose new robust classification algorithms for planar and spatial curves subjected to affine transformations. Our motivation comes from the problems in computer image recognit...
ICDCS
2006
IEEE
14 years 2 months ago
2006
IEEE
Byzantine quorum systems have been proposed that work properly even when up to f replicas fail arbitrarily. However, these systems are not so successful when confronted with Byzan...