Sciweavers

4131 search results - page 717 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
CCR
2006
76views more  CCR 2006»
15 years 6 months ago
Secure distributed data-mining and its application to large-scale network measurements
The rapid growth of the Internet over the last decade has been startling. However, efforts to track its growth have often fallen afoul of bad data -- for instance, how much traffi...
Matthew Roughan, Yin Zhang
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 6 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
BMCBI
2005
131views more  BMCBI 2005»
15 years 6 months ago
Regularized Least Squares Cancer Classifiers from DNA microarray data
Background: The advent of the technology of DNA microarrays constitutes an epochal change in the classification and discovery of different types of cancer because the information ...
Nicola Ancona, Rosalia Maglietta, Annarita D'Addab...
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 6 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite