Sciweavers

14548 search results - page 2726 / 2910
» The Optimal Path-Matching Problem
Sort
View
NIPS
2007
15 years 7 months ago
On Ranking in Survival Analysis: Bounds on the Concordance Index
In this paper, we show that classical survival analysis involving censored data can naturally be cast as a ranking problem. The concordance index (CI), which quantifies the quali...
Vikas C. Raykar, Harald Steck, Balaji Krishnapuram...
SODA
2008
ACM
95views Algorithms» more  SODA 2008»
15 years 7 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
PDPTA
2007
15 years 7 months ago
Mobile Thin-Client System with Fault Tolerance and Scalability by "HTTP-FUSE-KNOPPIX-BOX"
We have developed a mobile thin-client server named ”HTTP-FUSE-KNOPPIX-BOX” that incorporates mechanisms for increasing performance, distributing load, and providing fault tole...
Jun Kanai, Mitaro Namiki, Kuniyasu Suzaki, Toshiki...
146
Voted
SDM
2007
SIAM
120views Data Mining» more  SDM 2007»
15 years 7 months ago
An Analysis of Logistic Models: Exponential Family Connections and Online Performance
Logistic models are arguably one of the most widely used data analysis techniques. In this paper, we present analyses focussing on two important aspects of logistic models—its r...
Arindam Banerjee
SDM
2007
SIAM
204views Data Mining» more  SDM 2007»
15 years 7 months ago
Flexible Anonymization For Privacy Preserving Data Publishing: A Systematic Search Based Approach
k-anonymity is a popular measure of privacy for data publishing: It measures the risk of identity-disclosure of individuals whose personal information are released in the form of ...
Bijit Hore, Ravi Chandra Jammalamadaka, Sharad Meh...
« Prev « First page 2726 / 2910 Last » Next »