Sciweavers

155 search results - page 3 / 31
» The Problem with Noise and Small Disjuncts
Sort
View
IPCO
2008
118views Optimization» more  IPCO 2008»
13 years 6 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
ICASSP
2009
IEEE
13 years 9 months ago
Design of robust superdirective beamformers as a convex optimization problem
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
Edwin Mabande, Adrian Schad, Walter Kellermann
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 2 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra
BVAI
2007
Springer
13 years 11 months ago
Bounds of the Ability to Destroy Precise Coincidences by Spike Dithering
Correlation analysis of neuronal spiking activity relies on the availability of distributions for assessing significance. At present, these distributions can only be created by su...
Antonio Pazienti, Markus Diesmann, Sonja Grün
IJCAI
1989
13 years 6 months ago
Learning Novel Domains Through Curiosity and Conjecture
This paper describes DIDO, a system we have developed to carry out exploratory learning of unfamiliar domains without assistance from an external teacher. The program incorporates...
Paul D. Scott, Shaul Markovitch