Sciweavers

332 search results - page 27 / 67
» The Monochromatic Column problem
Sort
View
TKDE
2008
121views more  TKDE 2008»
14 years 9 months ago
Schema Matching Using Interattribute Dependencies
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
Jaewoo Kang, Jeffrey F. Naughton
MFCS
2007
Springer
15 years 3 months ago
Towards a Rice Theorem on Traces of Cellular Automata
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of p...
Julien Cervelle, Pierre Guillon
CORR
2006
Springer
93views Education» more  CORR 2006»
14 years 9 months ago
Unbiased Matrix Rounding
We show several ways to round a real matrix to an integer one such that the rounding errors in all rows and columns as well as the whole matrix are less than one. This is a classic...
Benjamin Doerr, Tobias Friedrich, Christian Klein,...
AIPS
2007
14 years 12 months ago
The Manpower Allocation Problem with Time Windows and Job-Teaming Constraints
The Manpower Allocation Problem with Time Windows, Job-Teaming Constraints and a limited number of teams (mMAPTWTC) is a crew scheduling problem faced in several different context...
Anders Dohn, Esben Kolind, Jens Clausen
SDM
2009
SIAM
118views Data Mining» more  SDM 2009»
15 years 6 months ago
Finding Links and Initiators: A Graph-Reconstruction Problem.
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
Evimaria Terzi, Heikki Mannila