Sciweavers

3110 search results - page 285 / 622
» On the initialization of the DNMF algorithm
Sort
View
ICCAD
1995
IEEE
106views Hardware» more  ICCAD 1995»
15 years 10 months ago
Re-engineering of timing constrained placements for regular architectures
In a typical design ow, the design may be altered slightly several times after the initial design cycle according to minor changes in the design speci cation either as a result o...
Anmol Mathur, K. C. Chen, C. L. Liu
APPROX
2010
Springer
137views Algorithms» more  APPROX 2010»
15 years 8 months ago
Online Embeddings
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
Piotr Indyk, Avner Magen, Anastasios Sidiropoulos,...
DAGSTUHL
2007
15 years 8 months ago
Matrix Analytic Methods in Branching processes
We examine the question of solving the extinction probability of a particular class of continuous-time multi-type branching processes, named Markovian binary trees (MBT). The exti...
Sophie Hautphenne, Guy Latouche, Marie-Ange Remich...
ECIR
2007
Springer
15 years 8 months ago
Incorporating Diversity and Density in Active Learning for Relevance Feedback
Abstract. Relevance feedback, which uses the terms in relevant documents to enrich the user’s initial query, is an effective method for improving retrieval performance. An assoc...
Zuobing Xu, Ram Akella, Yi Zhang 0001
NIPS
2008
15 years 8 months ago
Adapting to a Market Shock: Optimal Sequential Market-Making
We study the profit-maximization problem of a monopolistic market-maker who sets two-sided prices in an asset market. The sequential decision problem is hard to solve because the ...
Sanmay Das, Malik Magdon-Ismail