7006 search results - page 1170 / 1402 » Approximation Algorithms |
160
click to vote
QEST
2008
IEEE
16 years 22 days 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...
166
click to vote
CIKM
2005
Springer
15 years 12 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
153
click to vote
IMR
2005
Springer
15 years 12 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...
154
click to vote
ASM
2004
ASM
15 years 11 months ago
2004
ASM
Consider a multiple-agent transition system such that, for some basic types T1, . . . , Tn, the state of any agent can be represented as an element of the Cartesian product T1 ×·...
187
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...