Sciweavers

ESA
2004
Springer
105views Algorithms» more  ESA 2004»
14 years 3 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz
ECML
2004
Springer
14 years 3 months ago
Applying Support Vector Machines to Imbalanced Datasets
Support Vector Machines (SVM) have been extensively studied and have shown remarkable success in many applications. However the success of SVM is very limited when it is applied to...
Rehan Akbani, Stephen Kwek, Nathalie Japkowicz
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
14 years 3 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...
CPM
2004
Springer
86views Combinatorics» more  CPM 2004»
14 years 3 months ago
Optimizing Multiple Spaced Seeds for Homology Search
Optimized spaced seeds improve sensitivity and specificity in local homology search. Several authors have shown that multiple seeds can have better sensitivity and specificity t...
Jinbo Xu, Daniel G. Brown, Ming Li, Bin Ma
CP
2004
Springer
14 years 3 months ago
Computing the Frequency of Partial Orders
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...
Marc R. C. van Dongen
COLT
2004
Springer
14 years 3 months ago
Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
H. Brendan McMahan, Avrim Blum
CIARP
2004
Springer
14 years 3 months ago
Parallel Algorithm for Extended Star Clustering
In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of do...
Reynaldo Gil-García, José Manuel Bad...
CC
2004
Springer
160views System Software» more  CC 2004»
14 years 3 months ago
Elkhound: A Fast, Practical GLR Parser Generator
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
Scott McPeak, George C. Necula
CC
2004
Springer
14 years 3 months ago
Region-Based Partial Dead Code Elimination on Predicated Code
Abstract. This paper presents the design, implementation and experimental evaluation of a practical region-based partial dead code elimination (PDE) algorithm on predicated code in...
Qiong Cai, Lin Gao 0002, Jingling Xue
AUSAI
2004
Springer
14 years 3 months ago
Ant Colonies Discover Knight's Tours
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
Philip Hingston, Graham Kendall