Sciweavers

5329 search results - page 600 / 1066
» The Weighted Majority Algorithm
Sort
View
AAAI
2008
15 years 9 months ago
Reducing Particle Filtering Complexity for 3D Motion Capture using Dynamic Bayesian Networks
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
Cédric Rose, Jamal Saboune, François...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
ATAL
2008
Springer
15 years 8 months ago
Nonuniform bribery
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
Piotr Faliszewski
CEC
2007
IEEE
15 years 8 months ago
Fitness inheritance in evolutionary and multi-objective high-level synthesis
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
Christian Pilato, Gianluca Palermo, Antonino Tumeo...
ESA
2008
Springer
134views Algorithms» more  ESA 2008»
15 years 8 months ago
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
Spyros Angelopoulos