Sciweavers

138 search results - page 24 / 28
» Algorithms for induced biclique optimization problems
Sort
View
TCS
2008
13 years 7 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
CVPR
2008
IEEE
14 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
ISVC
2007
Springer
14 years 1 months ago
Boosting with Temporal Consistent Learners: An Application to Human Activity Recognition
We present a novel boosting algorithm where temporal consistency is addressed in a short-term way. Although temporal correlation of observed data may be an important cue for classi...
Pedro Canotilho Ribeiro, Plinio Moreno, José...
FSTTCS
2000
Springer
13 years 11 months ago
Text Sparsification via Local Maxima
In this paper we investigate some properties and algorithms related to a text sparsification technique based on the identification of local maxima in the given string. As the numb...
Pierluigi Crescenzi, Alberto Del Lungo, Roberto Gr...
SIGMETRICS
2002
ACM
115views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Maximum likelihood network topology identification from edge-based unicast measurements
Network tomography is a process for inferring "internal" link-level delay and loss performance information based on end-to-end (edge) network measurements. These methods...
Mark Coates, Rui Castro, Robert Nowak, Manik Gadhi...