Sciweavers

8647 search results - page 712 / 1730
» The Container Selection Problem
Sort
View
IWPEC
2010
Springer
15 years 5 months ago
On the Kernelization Complexity of Colorful Motifs
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
Abhimanyu M. Ambalath, Radheshyam Balasundaram, Ch...
IJCAI
1989
15 years 8 months ago
Recognizing Unnecessary Inference
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the ...
Dan Benanav
TKDE
2010
182views more  TKDE 2010»
15 years 5 months ago
MILD: Multiple-Instance Learning via Disambiguation
In multiple-instance learning (MIL), an individual example is called an instance and a bag contains a single or multiple instances. The class labels available in the training set ...
Wu-Jun Li, Dit-Yan Yeung
226
Voted
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
16 years 7 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch
GECCO
2005
Springer
163views Optimization» more  GECCO 2005»
16 years 28 days ago
An artificial immune system algorithm for CDMA multiuser detection over multi-path channels
Based on the Antibody Clonal Selection Theory of immunology, we put forward a novel clonal selection algorithm for multiuser detection in Code-division Multiple-access Systems. By...
Maoguo Gong, Ling Wang, Licheng Jiao, Haifeng Du