Sciweavers

198 search results - page 7 / 40
» On Extremal Cases of Hopcroft's Algorithm
Sort
View
72
Voted
DATESO
2010
286views Database» more  DATESO 2010»
14 years 9 months ago
Fast Fibonacci Encoding Algorithm
Abstract. Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups...
Jirí Walder, Michal Krátký, J...
80
Voted
SODA
2004
ACM
155views Algorithms» more  SODA 2004»
15 years 1 months ago
Navigating nets: simple algorithms for proximity search
d Abstract] Robert Krauthgamer James R. Lee We present a simple deterministic data structure for maintaining a set S of points in a general metric space, while supporting proximit...
Robert Krauthgamer, James R. Lee
GECCO
2003
Springer
163views Optimization» more  GECCO 2003»
15 years 4 months ago
Swarms in Dynamic Environments
Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achie...
T. M. Blackwell
98
Voted
DEBS
2007
ACM
15 years 3 months ago
Modeling the communication costs of content-based routing: the case of subscription forwarding
Content-based routing (CBR) provides the core distribution support of several middleware paradigms, most notably content-based publish-subscribe. Despite its popularity, however, ...
Stefano Castelli, Paolo Costa, Gian Pietro Picco
IBPRIA
2007
Springer
15 years 5 months ago
Parsimonious Kernel Fisher Discrimination
Abstract. By applying recent results in optimization transfer, a new algorithm for kernel Fisher Discriminant Analysis is provided that makes use of a non-smooth penalty on the coe...
Kitsuchart Pasupa, Robert F. Harrison, Peter Wille...