IAT
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
HAIS
2010
Springer
13 years 7 months ago
2010
Springer
In this article, we describe a feature selection algorithm which can automatically find relevant features for multiple instance learning. Multiple instance learning is considered a...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
The design of crosstalk mitigation techniques for DSL broadband access systems has mainly focused on physical layer transmit rate maximization. However, for certain applications, u...
GIS
2010
ACM
13 years 7 months ago
2010
ACM
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
GG
2010
Springer
13 years 7 months ago
2010
Springer
Mesh subdivision algorithms are usually specified informally using graphical schemes defining local mesh refinements. These algorithms are then implemented efficiently in an impera...
GEM
2010
13 years 7 months ago
2010
Abstract-- The problem of allocating defensive weapon resources to hostile targets is an optimization problem of high military relevance. The need for obtaining the solutions in re...
FUN
2010
Springer
13 years 7 months ago
2010
Springer
The bank director was pretty upset noticing Joe, the system administrator, spending his spare time playing Mastermind, an old useless game of the 70ies. He had fought the instinct ...
FORMATS
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents extensions of Safraless algorithms proposed in the literature for automata on infinite untimed words to the case of automata on infinite timed words.
ESA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We study an online version of Fisher's linear case market. In this market there are m buyers and a set of n dividable goods to be allocated to the buyers. The utilit...
ESA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...