398 search results - page 22 / 80 » A Data Allocation Algorithm for Distributed Hypermedia Docum... |
PPOPP
1999
ACM
14 years 6 days ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
AAAI
2012
11 years 10 months ago
2012
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior d...
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations rece...
CISS
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper presents an algorithm for distributed power control and scheduling over wireless ad hoc-networks, where the data rate on each link depends on the transmission power ...
ICDM
2007
IEEE
14 years 2 months ago
2007
IEEE
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...