Sciweavers

324 search results - page 19 / 65
» Bounds for Functions of Dependent Risks
Sort
View
PE
2007
Springer
112views Optimization» more  PE 2007»
14 years 11 months ago
Performance bounds for feedforward queueing networks with upper-constrained inputs
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a custom...
S. Shioda
CCS
2001
ACM
15 years 4 months ago
The faithfulness of abstract protocol analysis: message authentication
hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studyi...
Joshua D. Guttman, F. Javier Thayer, Lenore D. Zuc...
SIGIR
2009
ACM
15 years 6 months ago
Risky business: modeling and exploiting uncertainty in information retrieval
Most retrieval models estimate the relevance of each document to a query and rank the documents accordingly. However, such an approach ignores the uncertainty associated with the ...
Jianhan Zhu, Jun Wang, Ingemar J. Cox, Michael J. ...
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
15 years 3 months ago
Polynomial Time Summary Statistics for Two general Classes of Functions
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
Robert B. Heckendorn
TVLSI
1998
124views more  TVLSI 1998»
14 years 11 months ago
Computing support-minimal subfunctions during functional decomposition
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
Christian Legl, Bernd Wurth, Klaus Eckl