Sciweavers

41 search results - page 5 / 9
» Robustness of Equations Under Operational Extensions
Sort
View
QUESTA
2007
91views more  QUESTA 2007»
13 years 8 months ago
Iterative approximation of k -limited polling systems
The present paper deals with the problem of calculating queue length distributions in a polling model with (exhaustive) k-limited service under the assumption of general arrival, ...
M. van Vuuren, Erik M. M. Winands
ICIP
2008
IEEE
14 years 3 months ago
Hardware-friendly descreening
Conventional electrophotographic printers tend to produce Moir´e artifacts when used for printing images scanned from printed material such as books and magazines. We propose a n...
Hasib Siddiqui, Mireille Boutin, Charles A. Bouman
JCSS
2000
121views more  JCSS 2000»
13 years 8 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...
SRDS
2003
IEEE
14 years 2 months ago
Epidemic Spreading in Real Networks: An Eigenvalue Viewpoint
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite powerlaw graph, or any finite graph? How long does it take to disinfect a network giv...
Yang Wang 0008, Deepayan Chakrabarti, Chenxi Wang,...
PODS
1999
ACM
151views Database» more  PODS 1999»
14 years 1 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin