3875 search results - page 743 / 775 » Approximation algorithms for the 0-extension problem |
128
click to vote
PODS
2007
ACM
16 years 2 months ago
2007
ACM
We consider the problem of optimizing and executing multiple continuous queries, where each query is a conjunction of filters and each filter may occur in multiple queries. When f...
108
click to vote
WSDM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
111
click to vote
QEST
2008
IEEE
15 years 8 months ago
2008
IEEE
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...
107
click to vote
IMR
2005
Springer
15 years 7 months ago
2005
Springer
The first stage in an adaptive finite element scheme (cf. [CAS95, bor1]) consists in creating an initial mesh of a given domain Ω, which is used to perform an initial computati...
125
click to vote
PODS
2000
ACM
15 years 6 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...