1933 search results - page 108 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
133
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
111
Voted
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
142
Voted
PKDD
2010
Springer
15 years 1 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
160
Voted
SIGIR
2008
ACM
15 years 3 months ago
2008
ACM
The classical probabilistic models attempt to capture the Ad hoc information retrieval problem within a rigorous probabilistic framework. It has long been recognized that the prim...
148
Voted
MM
2004
ACM
15 years 9 months ago
2004
ACM
In this paper, we propose a novel transductive learning framework named manifold-ranking based image retrieval (MRBIR). Given a query image, MRBIR first makes use of a manifold ra...