1629 search results - page 260 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
114
click to vote
CIVR
2010
Springer
14 years 7 months ago
2010
Springer
In many applications, we find large video collections from different genres where the user is often only interested in one or two specific video genres. So, when users are queryin...
BMCBI
2006
14 years 10 months ago
2006
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
WWW
2007
ACM
15 years 10 months ago
2007
ACM
This paper is concerned with rank aggregation, the task of combining the ranking results of individual rankers at meta-search. Previously, rank aggregation was performed mainly by...
108
click to vote
BMCBI
2010
14 years 10 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...