Sciweavers

4843 search results - page 430 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
JMLR
2010
118views more  JMLR 2010»
14 years 11 months ago
Gaussian processes with monotonicity information
A method for using monotonicity information in multivariate Gaussian process regression and classification is proposed. Monotonicity information is introduced with virtual derivat...
Jaakko Riihimäki, Aki Vehtari
CORR
2011
Springer
157views Education» more  CORR 2011»
14 years 8 months ago
Orphan-Free Anisotropic Voronoi Diagrams
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in an...
Guillermo D. Cañas, Steven J. Gortler
MOBIHOC
2006
ACM
16 years 4 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
ICML
2009
IEEE
15 years 11 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 10 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker