17505 search results - page 3337 / 3501 » Use Cases as Workflows |
154
click to vote
VMCAI
2007
Springer
16 years 1 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
204
Voted
WABI
2007
Springer
16 years 1 months ago
2007
Springer
The comprehensive annotation of non-coding RNAs in newly sequenced genomes is still a largely unsolved problem because many functional RNAs exhibit not only poorly conserved sequen...
231
click to vote
WADS
2007
Springer
16 years 1 months ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
179
click to vote
WAW
2007
Springer
16 years 1 months ago
2007
Springer
Motivated by the problem of detecting link-spam, we consider the following graph-theoretic primitive: Given a webgraph G, a vertex v in G, and a parameter δ ∈ (0, 1), compute th...
167
Voted
WDAG
2007
Springer
16 years 1 months ago
2007
Springer
We introduce the problem of load-distance balancing in assigning users of a delay-sensitive networked application to servers. We model the service delay experienced by a user as a ...