882 search results - page 141 / 177 » Local Search for Very Large SAT Problems |
145
Voted
ICTAI
2010
IEEE
15 years 1 months ago
2010
IEEE
The balanced graph partitioning consists in dividing the vertices of an undirected graph into a given number of subsets of approximately equal size, such that the number of edges c...
111
Voted
ACCV
2010
Springer
14 years 10 months ago
2010
Springer
Estimating planar projective transform (homography) from a pair of images is a classical problem in computer vision. In this paper, we propose a novel algorithm for direct register...
138
Voted
BMCBI
2010
15 years 3 months ago
2010
Background: Computational identification of blood-secretory proteins, especially proteins with differentially expressed genes in diseased tissues, can provide highly useful inform...
134
click to vote
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
In this paper, we address the problem of detecting pedestrians in crowded real-world scenes with severe overlaps. Our basic premise is that this problem is too difficult for any t...
157
click to vote
UAI
2008
15 years 5 months ago
2008
Identifying co-varying causal elements in very high dimensional feature space with internal structures, e.g., a space with as many as millions of linearly ordered features, as one...