Sciweavers

1653 search results - page 30 / 331
» Directed tree-width examples
Sort
View
STACS
2010
Springer
14 years 4 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
ICMCS
2007
IEEE
133views Multimedia» more  ICMCS 2007»
14 years 4 months ago
Data Modeling Strategies for Imbalanced Learning in Visual Search
In this paper we examine a novel approach to the difficult problem of querying video databases using visual topics with few examples. Typically with visual topics, the examples a...
Jelena Tesic, Apostol Natsev, Lexing Xie, John R. ...
CORR
2012
Springer
195views Education» more  CORR 2012»
12 years 5 months ago
Ranking hubs and authorities using matrix functions
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
Michele Benzi, Ernesto Estrada, Christine Klymko
AO
2011
154views more  AO 2011»
13 years 4 months ago
MIREOT: The minimum information to reference an external ontology term
While the Web Ontology Language (OWL) provides a mechanism to import ontologies, this mechanism is not always suitable. First, given the current state of editing tools and the iss...
Mélanie Courtot, Frank Gibson, Allyson L. L...
CVPR
2012
IEEE
12 years 6 days ago
Filling large holes in LiDAR data by inpainting depth gradients
We introduce a technique to fill large holes in LiDAR data sets. We combine concepts from patch-based image inpainting and gradient-domain image editing to simultaneously fill b...
David Doria, Richard J. Radke