Sciweavers

42230 search results - page 141 / 8446
» Algorithms and Complexity Results for
Sort
View
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
15 years 11 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
PPSC
1997
15 years 7 months ago
A Parallel Algorithm for Interval Polynomial Interpolation
By taking data measurement errors into considerations, numerical results obtained by interval polynomial interpolation [5] are highly reliable. To reduce overestimation, combinati...
Chenyi Hu
BMCBI
2010
150views more  BMCBI 2010»
15 years 6 months ago
MCL-CAw: a refinement of MCL for detecting yeast complexes from weighted PPI networks by incorporating core-attachment structure
Background: The reconstruction of protein complexes from the physical interactome of organisms serves as a building block towards understanding the higher level organization of th...
Sriganesh Srihari, Kang Ning, Hon Wai Leong
IJAR
2007
96views more  IJAR 2007»
15 years 6 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
ICDT
2009
ACM
148views Database» more  ICDT 2009»
16 years 7 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha