Sciweavers

286 search results - page 30 / 58
» Proximality and Chebyshev sets
Sort
View
NIPS
1997
13 years 11 months ago
Active Data Clustering
Active data clustering is a novel technique for clustering of proximity data which utilizes principles from sequential experiment design in order to interleave data generation and...
Thomas Hofmann, Joachim M. Buhmann
CADE
2010
Springer
13 years 11 months ago
Premise Selection in the Naproche System
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
Marcos Cramer, Peter Koepke, Daniel Kühlwein,...
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 7 months ago
Stochastic optimization for Markov modulated networks with application to delay constrained wireless scheduling
Abstract-- We consider a wireless system with a small number of delay constrained users and a larger number of users without delay constraints. We develop a scheduling algorithm th...
Michael J. Neely
JMLR
2011
167views more  JMLR 2011»
13 years 4 months ago
Logistic Stick-Breaking Process
A logistic stick-breaking process (LSBP) is proposed for non-parametric clustering of general spatially- or temporally-dependent data, imposing the belief that proximate data are ...
Lu Ren, Lan Du, Lawrence Carin, David B. Dunson
JCC
2008
88views more  JCC 2008»
13 years 9 months ago
A self-organizing algorithm for molecular alignment and pharmacophore development
Abstract: We present a method for simultaneous three-dimensional (3D) structure generation and pharmacophorebased alignment using a self-organizing algorithm called Stochastic Prox...
Deepak Bandyopadhyay, Dimitris K. Agrafiotis