Sciweavers

725 search results - page 125 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
CCR
2010
179views more  CCR 2010»
14 years 9 months ago
An argument for increasing TCP's initial congestion window
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...
Nandita Dukkipati, Tiziana Refice, Yuchung Cheng, ...
77
Voted
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
15 years 10 months ago
Predicting prostate cancer recurrence via maximizing the concordance index
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
Lian Yan, David Verbel, Olivier Saidi
PLDI
2006
ACM
15 years 3 months ago
DieHard: probabilistic memory safety for unsafe languages
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling pointers, and reads of uninitialized data. Such errors ...
Emery D. Berger, Benjamin G. Zorn
CVPR
2004
IEEE
15 years 11 months ago
Wide Baseline Feature Matching Using the Cross-Epipolar Ordering Constraint
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...
Xiaoye Lu, Roberto Manduchi
183
Voted
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
15 years 11 months ago
Querying Imprecise Data in Moving Object Environments
In moving object environments, it is infeasible for the database tracking the movement of objects to store the exact locations of objects at all times. Typically, the location of a...
Reynold Cheng, Sunil Prabhakar, Dmitri V. Kalashni...