Sciweavers

358 search results - page 56 / 72
» GCD of Many Integers
Sort
View
MP
1998
109views more  MP 1998»
13 years 7 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 6 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
INFORMS
2010
107views more  INFORMS 2010»
13 years 6 months ago
A Class Representative Model for Pure Parsimony Haplotyping
Haplotyping estimation from aligned Single Nucleotide Polymorphism (SNP) fragments has attracted more and more attention in the recent years due to its importance in analysis of m...
Daniele Catanzaro, Alessandra Godi, Martine Labb&e...
MICS
2010
134views more  MICS 2010»
13 years 5 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
PSD
2010
Springer
109views Database» more  PSD 2010»
13 years 5 months ago
A Tool for Analyzing and Fixing Infeasible RCTA Instances
Minimum-distance controlled tabular adjustment methods (CTA), and its restricted variants (RCTA), is a recent perturbative approach for tabular data protection. Given a table to be...
Jordi Castro, José A. González