Sciweavers

3172 search results - page 261 / 635
» New developments of the Z-EDM algorithm
Sort
View
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 10 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
BMCBI
2007
152views more  BMCBI 2007»
15 years 6 months ago
A cross-species alignment tool (CAT)
Background: The main two sorts of automatic gene annotation frameworks are ab initio and alignment-based, the latter splitting into two sub-groups. The first group is used for int...
Heng Li, Liang Guan, Tao Liu, Yiran Guo, Wei-Mou Z...
KDD
2005
ACM
192views Data Mining» more  KDD 2005»
16 years 7 months ago
Modeling and predicting personal information dissemination behavior
In this paper, we propose a new way to automatically model and predict human behavior of receiving and disseminating information by analyzing the contact and content of personal c...
Xiaodan Song, Ching-Yung Lin, Belle L. Tseng, Ming...
MOBIHOC
2005
ACM
16 years 6 months ago
Temporal properties of low power wireless links: modeling and implications on multi-hop routing
Recently, several studies have analyzed the statistical properties of low power wireless links in real environments, clearly demonstrating the differences between experimentally o...
Alberto Cerpa, Jennifer L. Wong, Miodrag Potkonjak...
PRICAI
2004
Springer
15 years 12 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...