Sciweavers

216 search results - page 43 / 44
» Exact Algorithms for L (2, 1)-Labeling of Graphs
Sort
View
PKDD
2005
Springer
188views Data Mining» more  PKDD 2005»
14 years 13 days ago
Elastic Partial Matching of Time Series
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
Longin Jan Latecki, Vasilis Megalooikonomou, Qiang...
SPAA
2005
ACM
14 years 15 days ago
Value-maximizing deadline scheduling and its application to animation rendering
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
Eric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri...
INFOCOM
2007
IEEE
14 years 1 months ago
Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
GLOBECOM
2008
IEEE
14 years 1 months ago
Optimal LLR Clipping Levels for Mixed Hard/Soft Output Detection
Abstract—Consider a communications system where the detector generates a mix of hard and soft outputs, which are then fed into a soft-input channel decoder. In such a setting, it...
Ernesto Zimmermann, David L. Milliner, John R. Bar...
BMCBI
2011
12 years 10 months ago
Detection of recurrent rearrangement breakpoints from copy number data
Background: Copy number variants (CNVs), including deletions, amplifications, and other rearrangements, are common in human and cancer genomes. Copy number data from array compara...
Anna M. Ritz, Pamela L. Paris, Michael Ittmann, Co...