724 search results - page 86 / 145 » Some Structural Complexity Aspects of Neural Computation |
106
click to vote
TKDE
2012
13 years 6 days ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
COCOON
1999
Springer
15 years 2 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
CVPR
2001
IEEE
15 years 11 months ago
2001
IEEE
Efficient detection of objects in images is complicated by variations of object appearance due to intra-class object differences, articulation, lighting, occlusions, and aspect va...
68
Voted
BMCBI
2010
14 years 10 months ago
2010
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
We study and compare two novel embedding methods for segmenting feature points of piece-wise planar structures from two (uncalibrated) perspective images. We show that a set of di...