Sciweavers

7522 search results - page 133 / 1505
» Spacing memetic algorithms
Sort
View
DEBS
2009
ACM
15 years 4 months ago
MICS: an efficient content space representation model for publish/subscribe systems
One of the main challenges faced by content-based publish/subscribe systems is handling large amount of dynamic subscriptions and publications in a multidimensional content space....
Hojjat Jafarpour, Sharad Mehrotra, Nalini Venkatas...
FAW
2009
Springer
118views Algorithms» more  FAW 2009»
15 years 4 months ago
Space-Query-Time Tradeoff for Computing the Visibility Polygon
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
Mostafa Nouri, Mohammad Ghodsi
COLT
2010
Springer
14 years 10 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari
99
Voted
JDA
2006
106views more  JDA 2006»
15 years 19 days ago
An optimal algorithm to generate tilings
We produce an algorithm that is optimal with respect to both space and execution time to generate all the lozenge (or domino) tilings of a hole-free, general-shape domain given as...
Sébastien Desreux, Eric Rémila
PRL
1998
152views more  PRL 1998»
15 years 10 days ago
A 3D 6-subiteration thinning algorithm for extracting medial lines
Thinning is a frequently used method for extracting skeletons in discrete spaces. This paper presents an efficient parallel Žthinning algorithm that directly extracts medial line...
Kálmán Palágyi, Attila Kuba