Sciweavers

2446 search results - page 98 / 490
» Where am I
Sort
View
ICALP
2011
Springer
14 years 7 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 4 months ago
Model compression
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
Cristian Bucila, Rich Caruana, Alexandru Niculescu...
GECCO
2010
Springer
180views Optimization» more  GECCO 2010»
15 years 6 months ago
Coevolution of heterogeneous multi-robot teams
Evolving multiple robots so that each robot acting independently can contribute to the maximization of a system level objective presents significant scientific challenges. For e...
Matt Knudson, Kagan Tumer
CORR
2010
Springer
138views Education» more  CORR 2010»
15 years 4 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
FFA
2008
42views more  FFA 2008»
15 years 4 months ago
Weyl sums in Fq[x] with digital restrictions
Let Fq be a finite field and consider the polynomial ring Fq[X]. Let Q Fq[X]. A function f : Fq[X] G, where G is a group, is called strongly Q-additive, if f(AQ + B) = f(A) + f(B...
Manfred G. Madritsch, Jörg M. Thuswaldner