Sciweavers

933 search results - page 42 / 187
» Monotone Complexity of a Pair
Sort
View
EVOW
2008
Springer
13 years 9 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
CORR
2006
Springer
78views Education» more  CORR 2006»
13 years 7 months ago
What is the probability of connecting two points ?
The two-terminal reliability, known as the pair connectedness or connectivity function in percolation theory, may actually be expressed as a product of transfer matrices in which t...
Christian Tanguy
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 12 days ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 7 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
WG
2009
Springer
14 years 2 months ago
Distance d-Domination Games
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
Stephan Kreutzer, Sebastian Ordyniak