Sciweavers

1242 search results - page 116 / 249
» A Computational Complexity Theory in Membrane Computing
Sort
View
STACS
2009
Springer
15 years 4 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
MIRAGE
2007
Springer
15 years 4 months ago
Segmentation of Soft Shadows Based on a Daylight- and Penumbra Model
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of an alpha overlay shadow model. Previou...
Michael Nielsen, Claus B. Madsen
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Multi-unit auctions with budget-constrained bidders
We study a multi-unit auction with multiple bidders, each of whom has a private valuation and a budget. The truthful mechanisms of such an auction are characterized, in the sense ...
Christian Borgs, Jennifer T. Chayes, Nicole Immorl...
SIGECOM
2003
ACM
119views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
Preference elicitation in proxied multiattribute auctions
We consider the problem of minimizing preference elicitation in efficient multiattribute auctions, that support dynamic negotiation over non-price based attributes such as qualit...
Aditya V. Sunderam, David C. Parkes
INFOCOM
1997
IEEE
15 years 2 months ago
Time Scale Analysis of an ATM Queueing System with Long-Range Dependent Traffic
Several types of network trafic have been shown to exhibit long-range dependence (LRD). In this work, we show that the busy period of an ATM system driven by a long-range dependen...
Gilberto Mayor, John A. Silvester