Sciweavers

626 search results - page 60 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
ICML
2005
IEEE
16 years 1 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
99
Voted
IJSNET
2008
125views more  IJSNET 2008»
15 years 17 days ago
Minimum-cost sensor arrangement for achieving wanted coverage lifetime
: Suppose we need to watch a set of targets continuously for a required period of time, and suppose we choose any number of sensors from a fixed set of sensor types and place them ...
Jie Wang, Ning Zhong
ALGORITHMICA
1998
184views more  ALGORITHMICA 1998»
15 years 8 days ago
Approximation Algorithms for Connected Dominating Sets
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
Sudipto Guha, Samir Khuller
91
Voted
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 3 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
TAMC
2009
Springer
15 years 7 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens