1538 search results - page 197 / 308 » Spectral Techniques in Graph Algorithms |
140
Voted
ISBRA
2009
Springer
15 years 10 months ago
2009
Springer
Recent techniques increase the amount of our knowledge of interactions between proteins. To filter, interpret and organize this data, many authors have provided tools for querying...
120
Voted
WSDM
2010
ACM
16 years 1 months ago
2010
ACM
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
126
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
145
Voted
FLAIRS
2008
15 years 6 months ago
2008
Solving relaxed problems is a commonly used technique in heuristic search to derive heuristic estimates. In heuristic planning, this is usually done by expanding a planning (reach...
129
Voted
ICAPR
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate t...