3894 search results - page 544 / 779 » Approximation Algorithms for Biclustering Problems |
203
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
138
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
164
click to vote
CIAC
1994
Springer
15 years 8 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
141
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
— Self-monitoring the sensor statuses such as liveness, node density and residue energy is critical for maintaining the normal operation of the sensor network. When building the ...
228
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
Consider a set of signals fs : {1, . . . , N} [0, . . . , M] appearing as a stream of tuples (i, fs(i)) in arbitrary order of i and s. We would like to devise one pass approximat...