Sciweavers

6202 search results - page 56 / 1241
» Without Loss of Generality
Sort
View
JMLR
2010
105views more  JMLR 2010»
14 years 4 months ago
Classification Methods with Reject Option Based on Convex Risk Minimization
In this paper, we investigate the problem of binary classification with a reject option in which one can withhold the decision of classifying an observation at a cost lower than t...
Ming Yuan, Marten H. Wegkamp
WWW
2005
ACM
15 years 10 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
CHI
2004
ACM
15 years 10 months ago
Multiblending: displaying overlapping windows simultaneously without the drawbacks of alpha blending
Alpha blending allows the simultaneous display of overlapping windows--such as palette windows in visual workspaces. Although alpha blending has been used in some applications, su...
Patrick Baudisch, Carl Gutwin
STOC
2004
ACM
129views Algorithms» more  STOC 2004»
15 years 10 months ago
Sorting and searching in the presence of memory faults (without redundancy)
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
Irene Finocchi, Giuseppe F. Italiano
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
15 years 10 months ago
GhostDB: querying visible and hidden data without leaks
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...
Nicolas Anciaux, Mehdi Benzine, Luc Bouganim, Phil...