Sciweavers

1105 search results - page 216 / 221
» Linear choosability of graphs
Sort
View
AAAI
2006
14 years 11 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
92
Voted
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
14 years 11 months ago
Steiner points in tree metrics don't (really) help
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
Anupam Gupta

Book
34534views
16 years 8 months ago
OpenCV - Open Source Computer Vision Reference Manual
OpenCV is a C/C++ computer vision library originally developed by Intel. It is free for commercial and research use under a BSD license. The library is cross-platform. It is highl...
Intel
4OR
2010
137views more  4OR 2010»
14 years 9 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
BMCBI
2008
228views more  BMCBI 2008»
14 years 9 months ago
Adaptive diffusion kernel learning from biological networks for protein function prediction
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
Liang Sun, Shuiwang Ji, Jieping Ye