1201 search results - page 235 / 241 » Linear Probing and Graphs |
SODA
2001
ACM
13 years 11 months ago
2001
ACM
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 ...
209
click to vote
Book
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...
4OR
2010
13 years 10 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
BMCBI
2008
13 years 10 months ago
2008
Background: Machine-learning tools have gained considerable attention during the last few years for analyzing biological networks for protein function prediction. Kernel methods a...
CC
2008
Springer
13 years 10 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...