3007 search results - page 314 / 602 » Linear Functional Fixed-points |
129
click to vote
RECOMB
2008
Springer
16 years 4 months ago
2008
Springer
We developed Gr?mlin 2.0, a new multiple network aligner with (1) a novel scoring function that can use arbitrary features of a multiple network alignment, such as protein deletion...
147
Voted
ICCAD
2007
IEEE
16 years 22 days ago
2007
IEEE
— Small gates, such as AND2, XOR2 and MUX2, have been mixed with lookup tables (LUTs) inside the programmable logic block (PLB) to reduce area and power and increase performance ...
153
click to vote
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
114
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We address the problem of foothold selection in robotic legged locomotion over very rough terrain. The difficulty of the problem we address here is comparable to that of human...
150
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...