1816 search results - page 189 / 364 » A New Approach for Solving the Maximum Clique Problem |
162
click to vote
ISCAS
1994
IEEE
15 years 10 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
263
click to vote
GIS
2007
ACM
2007
ACM
Exploiting automatically inferred constraint-models for building identification in satellite imagery
16 years 7 months ago
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...
172
click to vote
AB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Haplotype inference from genotype data is a key computational problem in bioinformatics, since retrieving directly haplotype information from DNA samples is not feasible ...
191
click to vote
JCM
2007
15 years 6 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
160
click to vote
ICPPW
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper explores several systems issues regarding the implementation of routing protocols for mobile ad-hoc networks. It proclaims that support for on-demand routing is insufï¬...