2957 search results - page 552 / 592 » The Complexity of Polynomial-Time Approximation |
ISBI
2008
IEEE
14 years 8 months ago
2008
IEEE
We propose a system for identification of germ layer components in teratomas derived from human and nonhuman primate embryonic stem cells. Tissue regeneration and repair, drug tes...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
We consider the wavelet synopsis construction problem for data streams where given n numbers we wish to estimate the data by constructing a synopsis, whose size, say B is much sma...