1201 search results - page 98 / 241 » Linear Probing and Graphs |
106
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
107
click to vote
IMC
2007
ACM
15 years 2 months ago
2007
ACM
We address the problem of calculating link loss rates from end-to-end measurements. Contrary to existing works that use only the average end-to-end loss rates or strict temporal c...
117
click to vote
BIOINFORMATICS
2005
15 years 26 days ago
2005
Motivation. Spotted arrays are often printed with probes in duplicate or triplicate, but current methods for assessing differential expression are not able to make full use of the...
ICIAR
2007
Springer
15 years 7 months ago
2007
Springer
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
A technique for calibrating a network of perspective cameras based on their graph of trifocal tensors is presented. After estimating a set of reliable epipolar geometries, a parame...