Sciweavers

3019 search results - page 25 / 604
» Approximating the Domatic Number
Sort
View
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
12 years 10 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...
CIKM
2005
Springer
14 years 29 days ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik
BMCBI
2010
82views more  BMCBI 2010»
13 years 7 months ago
Genome-wide estimation of firing efficiencies of origins of DNA replication from time-course copy number variation data
Background: DNA replication is a fundamental biological process during S phase of cell division. It is initiated from several hundreds of origins along whole chromosome with diffe...
Huaien Luo, Juntao Li, Majid Eshaghi, Jianhua Liu,...
SIAMSC
2011
177views more  SIAMSC 2011»
13 years 2 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
COMPGEOM
2011
ACM
12 years 11 months ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang