1629 search results - page 174 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
194
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
With the ubiquity of information networks and their broad applications, the issue of similarity computation between entities of an information network arises and draws extensive r...
183
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
278
click to vote
SIGMOD
2006
ACM
16 years 6 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
206
click to vote
AIPS
2009
15 years 7 months ago
2009
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
169
click to vote
AI
2006
Springer
15 years 6 months ago
2006
Springer
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...