Sciweavers

1299 search results - page 94 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
FOCS
1997
IEEE
15 years 2 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
14 years 11 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...
WABI
2007
Springer
123views Bioinformatics» more  WABI 2007»
15 years 3 months ago
Inverse Sequence Alignment from Partial Examples
When aligning biological sequences, the choice of parameter values for the alignment scoring function is critical. Small changes in gap penalties, for example, can yield radically ...
Eagu Kim, John D. Kececioglu
ECRTS
2010
IEEE
14 years 11 months ago
Partitioning Parallel Applications on Multiprocessor Reservations
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
Giorgio C. Buttazzo, Enrico Bini, Yifan Wu
CIKM
2011
Springer
13 years 9 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai