258 search results - page 36 / 52 » New Lower Bounds for Heilbronn Numbers |
ICCV
2009
IEEE
15 years 14 days ago
2009
IEEE
Many interactive image segmentation approaches use an objective function which includes appearance models as an unknown variable. Since the resulting optimization problem is NP-har...
ALT
2002
Springer
14 years 4 months ago
2002
Springer
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
In this paper, we characterize the performance of an important class of scheduling schemes, called Greedy Maximal Scheduling (GMS), for multi-hop wireless networks. While a lower ...
SISAP
2008
IEEE
14 years 1 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We contribute to the research on stable minimum storage merging by introducing an algorithm that is particularly simply structured compared to its competitors. The presented algori...