Sciweavers

3019 search results - page 55 / 604
» Approximating the Domatic Number
Sort
View
ECML
2006
Springer
15 years 3 months ago
Constant Rate Approximate Maximum Margin Algorithms
We present a new class of perceptron-like algorithms with margin in which the "effective" learning rate, defined as the ratio of the learning rate to the length of the we...
Petroula Tsampouka, John Shawe-Taylor
ACL
2007
15 years 1 months ago
Grammar Approximation by Representative Sublanguage: A New Model for Language Learning
We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic ...
Smaranda Muresan, Owen Rambow
MOR
2006
123views more  MOR 2006»
14 years 11 months ago
Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into ...
Nikhil Bansal, José R. Correa, Claire Kenyo...
SIAMCOMP
2008
101views more  SIAMCOMP 2008»
14 years 11 months ago
Combination Can Be Hard: Approximability of the Unique Coverage Problem
We prove semi-logarithmic inapproximability for a maximization problem called unique coverage: given a collection of sets, find a subcollection that maximizes the number of elemen...
Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiag...
ICASSP
2011
IEEE
14 years 3 months ago
Spatially-correlated sensor discriminant analysis
A study of generalization error in signal detection by multiple spatially-distributed and -correlated sensors is provided when the detection rule is learned from a finite number ...
Kush R. Varshney