Sciweavers

1449 search results - page 190 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
SCAM
2008
IEEE
16 years 20 days ago
Constructing Subtle Faults Using Higher Order Mutation Testing
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...
Yue Jia, Mark Harman
ICASSP
2007
IEEE
16 years 18 days ago
Particle PHD Filtering for Multi-Target Visual Tracking
We propose a multi-target tracking algorithm based on the Probability Hypothesis Density (PHD) filter and data association using graph matching. The PHD filter is used to compen...
Emilio Maggio, Elisa Piccardo, Carlo S. Regazzoni,...
SIGECOM
2005
ACM
153views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
Marginal contribution nets: a compact representation scheme for coalitional games
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Samuel Ieong, Yoav Shoham
CP
2005
Springer
15 years 11 months ago
Approximations in Distributed Optimization
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
Adrian Petcu, Boi Faltings
COLT
2001
Springer
15 years 10 months ago
Learning Additive Models Online with Fast Evaluating Kernels
Abstract. We develop three new techniques to build on the recent advances in online learning with kernels. First, we show that an exponential speed-up in prediction time per trial ...
Mark Herbster