406 search results - page 19 / 82 » Kernelization and Complexity Results for Connectivity Augmen... |
STOC
2004
ACM
15 years 9 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
BMCBI
2010
14 years 9 months ago
2010
Background: The construction of interaction networks between proteins is central to understanding the underlying biological processes. However, since many useful relations are exc...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
DSS
2006
14 years 9 months ago
2006
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...