96 search results - page 10 / 20 » Algorithm Engineering for Optimal Graph Bipartization |
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
SIROCCO
2007
13 years 9 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...
FSTTCS
2001
Springer
14 years 11 days ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
CIVR
2010
Springer
14 years 21 days ago
2010
Springer
This paper describes an approach to optimize query by visual example results, by combining visual features and implicit user feedback in interactive video retrieval. To this end, ...