Sciweavers

1429 search results - page 126 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 9 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
ICCAD
2010
IEEE
124views Hardware» more  ICCAD 2010»
13 years 7 months ago
Symbolic performance analysis of elastic systems
Elastic systems, either synchronous or asynchronous, can be optimized for the average-case performance when they have units with early evaluation or variable latency. The performan...
Marc Galceran Oms, Jordi Cortadella, Michael Kishi...
ISSAC
2007
Springer
132views Mathematics» more  ISSAC 2007»
14 years 3 months ago
Structured matrix methods for polynomial root-finding
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
Luca Gemignani
PAMI
2008
139views more  PAMI 2008»
13 years 9 months ago
A Fast Algorithm for Learning a Ranking Function from Large-Scale Data Sets
We consider the problem of learning a ranking function that maximizes a generalization of the Wilcoxon-Mann-Whitney statistic on the training data. Relying on an -accurate approxim...
Vikas C. Raykar, Ramani Duraiswami, Balaji Krishna...
ESA
2004
Springer
105views Algorithms» more  ESA 2004»
14 years 2 months ago
Time Dependent Multi Scheduling of Multicast
Many network applications that need to distribute content and data to a large number of clients use a hybrid scheme in which one (or more) multicast channel is used in parallel to...
Rami Cohen, Dror Rawitz, Danny Raz