Sciweavers

2542 search results - page 48 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
SDMW
2004
Springer
14 years 1 months ago
Experimental Analysis of Privacy-Preserving Statistics Computation
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...
Hiranmayee Subramaniam, Rebecca N. Wright, Zhiqian...
IWPEC
2009
Springer
14 years 2 months ago
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
Peter Damaschke
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 1 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
CVPR
2009
IEEE
15 years 2 months ago
Discriminatively Trained Particle Filters for Complex Multi-Object Tracking
This work presents a discriminative training method for particle filters in the context of multi-object tracking. We are motivated by the difficulty of hand-tuning the many mode...
Alan Fern, Robin Hess
GI
2007
Springer
14 years 1 months ago
Multisensor Based Generation of Templates for Object Tracking in Complex Scenarios
Abstract: Protection and surveillance of persons and facilities is frequently associated with automatic tracking of striking objects like vehicles or persons in an image sequence. ...
Carmen Witte, Klaus Jäger, Walter Armbruster,...