Sciweavers

1332 search results - page 30 / 267
» An Efficient Algorithm for the Approximate Median Selection ...
Sort
View
INFOCOM
2009
IEEE
14 years 3 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 9 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
Neuroevolutionary optimization
Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning ...
Eva Volná
TNN
2008
105views more  TNN 2008»
13 years 8 months ago
Generalized Linear Discriminant Analysis: A Unified Framework and Efficient Model Selection
Abstract--High-dimensional data are common in many domains, and dimensionality reduction is the key to cope with the curse-of-dimensionality. Linear discriminant analysis (LDA) is ...
Shuiwang Ji, Jieping Ye
ESANN
2006
13 years 9 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...