Sciweavers

1920 search results - page 341 / 384
» The Complexity of the A B C Problem
Sort
View
KDD
2005
ACM
165views Data Mining» more  KDD 2005»
14 years 9 months ago
Co-clustering by block value decomposition
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
HPCA
2002
IEEE
14 years 9 months ago
CableS: Thread Control and Memory Management Extensions for Shared Virtual Memory Clusters
Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although c...
Peter Jamieson, Angelos Bilas
EDBT
2006
ACM
127views Database» more  EDBT 2006»
14 years 8 months ago
Progressive Query Optimization for Federated Queries
Federated queries are regular relational queries accessing data on one or more remote relational or non-relational data sources, possibly combining them with tables stored in the ...
Stephan Ewen, Holger Kache, Volker Markl, Vijaysha...
MOBISYS
2004
ACM
14 years 8 months ago
Tracking Moving Devices with the Cricket Location System
We study the problem of tracking a moving device under two indoor location architectures: an active mobile architecture and a passive mobile architecture. In the former, the infra...
Adam Smith, Hari Balakrishnan, Michel Goraczko, Ni...
MOBIHOC
2005
ACM
14 years 8 months ago
Power balanced coverage-time optimization for clustered wireless sensor networks
We consider a wireless sensor network in which sensors are grouped into clusters, each with its own cluster head (CH). Each CH collects data from sensors in its cluster and relays...
Tao Shu, Marwan Krunz, Sarma B. K. Vrudhula