3934 search results - page 184 / 787 » Approximate Schedulability Analysis |
184
click to vote
SARA
2009
Springer
16 years 1 months ago
2009
Springer
MINLP problems are hard constrained optimization problems, with nonlinear constraints and mixed discrete continuous variables. They can be solved using a Branch-and-Bound scheme c...
147
click to vote
CEC
2007
IEEE
16 years 24 days ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
173
click to vote
ICDM
2007
IEEE
16 years 23 days ago
2007
IEEE
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
148
click to vote
ACCV
2006
Springer
16 years 13 days ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
155
click to vote
ASAP
2005
IEEE
16 years 2 days ago
2005
IEEE
The Radon transform (RT) is a widely studied algorithm used to perform image pattern extraction in fields such as computer graphics, medical imagery, and avionics. Real-time impl...