9842 search results - page 1358 / 1969 » The Complexity of the Matching-Cut Problem |
186
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
179
click to vote
PSIVT
2007
Springer
16 years 1 months ago
2007
Springer
This paper considers the problem of Bayesian inference in dynamical models with time-varying dimension. These models have been studied in the context of multiple target tracking pr...
195
click to vote
IPPS
2005
IEEE
16 years 25 days ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
246
click to vote
SIGECOM
2010
ACM
16 years 1 days ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
204
click to vote
NIS
1998
15 years 6 months ago
1998
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...