2430 search results - page 407 / 486 » Computing Tutte Polynomials |
125
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
102
Voted
ESA
2010
Springer
15 years 3 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
127
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
121
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
134
Voted
ICDE
2010
IEEE
16 years 2 months ago
2010
IEEE
K Nearest Neighbor search has many applications including data mining, multi-media, image processing, and monitoring moving objects. In this paper, we study the problem of KNN over...