2392 search results - page 149 / 479 » Matching data dissemination algorithms to application requir... |
182
click to vote
NIPS
2003
15 years 7 months ago
2003
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
180
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
The rigid all-versus-all adjacency required by a maximal biclique for its two vertex sets is extremely vulnerable to missing data. In the past, several types of quasi-bicliques ha...
140
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
We consider a class of algorithms related to Lempel-Ziv that incorporate restrictions on the manner in which the data can be parsed with the goal of introducing new tradeoffs betwe...
179
click to vote
HICSS
2006
IEEE
16 years 17 days ago
2006
IEEE
Utility provisioning, Grid resource management, instant copy kiosks, and network transfers provide an exciting new paradigm for data warehouse functions. Grid technologies are fas...
219
click to vote
ICNSC
2008
IEEE
16 years 28 days ago
2008
IEEE
— Dynamic scheduling management in wireless sensor networks is one of the most challenging problems in long lifetime monitoring applications. In this paper, we propose and evalua...