Sciweavers

1942 search results - page 315 / 389
» HINT: A new way to measure computer performance
Sort
View
SISAP
2008
IEEE
98views Data Mining» more  SISAP 2008»
15 years 6 months ago
On Reinsertions in M-tree
In this paper we introduce a new M-tree building method, utilizing the classic idea of forced reinsertions. In case a leaf is about to split, some distant objects are removed from...
Jakub Lokoc, Tomás Skopal
INFOSCALE
2006
ACM
15 years 5 months ago
A library of constructive skeletons for sequential style of parallel programming
Abstract— With the increasing popularity of parallel programming environments such as PC clusters, more and more sequential programmers, with little knowledge about parallel arch...
Kiminori Matsuzaki, Hideya Iwasaki, Kento Emoto, Z...
ENC
2005
IEEE
15 years 5 months ago
Saving Evaluations in Differential Evolution for Constrained Optimization
Generally, evolutionary algorithms require a large number of evaluations of the objective function in order to obtain a good solution. This paper presents a simple approach to sav...
Efrén Mezura-Montes, Carlos A. Coello Coell...
LCN
2005
IEEE
15 years 5 months ago
On the Server Fairness of Congestion Control in the ISP Edge Router
The Internet Engineering Task Force (IETF) recommended the deployment of Active Queue Management (AQM) in the Internet routers in 1998. There were more than 50 new AQM algorithms ...
Hsien-Ming Wu, Chin-Chi Wu, Woei Lin
DAGM
2005
Springer
15 years 5 months ago
Spiders as Robust Point Descriptors
This paper introduces a new operator to characterize a point in an image in a distinctive and invariant way. The robust recognition of points is a key technique in computer vision:...
Adam Stanski, Olaf Hellwich