Sciweavers

1095 search results - page 69 / 219
» Preprocessing of Intractable Problems
Sort
View
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 months ago
The Dichotomy of List Homomorphisms for Digraphs
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
Pavol Hell, Arash Rafiey
EDBT
2011
ACM
231views Database» more  EDBT 2011»
13 years 1 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
14 years 1 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen
ICPR
2004
IEEE
14 years 11 months ago
A Rival Penalized EM Algorithm towards Maximizing Weighted Likelihood for Density Mixture Clustering with Automatic Model Select
How to determine the number of clusters is an intractable problem in clustering analysis. In this paper, we propose a new learning paradigm named Maximum Weighted Likelihood (MwL)...
Yiu-ming Cheung
ICC
2009
IEEE
210views Communications» more  ICC 2009»
14 years 4 months ago
Weighted Sum-Rate Maximization Using Weighted MMSE for MIMO-BC Beamforming Design
—This paper studies linear transmit filter design for Weighted Sum-Rate (WSR) maximization in the Multiple Input Multiple Output Broadcast Channel (MIMO-BC). The problem of fin...
Søren Skovgaard Christensen, Rajiv Agarwal,...