Sciweavers

364 search results - page 44 / 73
» Generalized normal forms and polynomial system solving
Sort
View
QEST
2008
IEEE
15 years 4 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
99
Voted
CP
2010
Springer
14 years 8 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...
IPPS
2009
IEEE
15 years 4 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert
88
Voted
SAC
2010
ACM
15 years 4 months ago
CAPTCHA smuggling: hijacking web browsing sessions to create CAPTCHA farms
CAPTCHAs protect online resources and services from automated access. From an attacker’s point of view, they are typically perceived as an annoyance that prevents the mass creat...
Manuel Egele, Leyla Bilge, Engin Kirda, Christophe...