4843 search results - page 827 / 969 » The Shortcut Problem - Complexity and Approximation |
124
click to vote
AIRS
2004
Springer
15 years 8 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
127
click to vote
ARCS
2004
Springer
15 years 8 months ago
2004
Springer
In a pervasive computing environment, one is facing the problem of handling heterogeneous data from different sources, transmitted over heterogeneous channels and presented on het...
106
click to vote
CAAN
2004
Springer
15 years 8 months ago
2004
Springer
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
116
click to vote
COLT
2004
Springer
15 years 8 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...
145
click to vote
DSMML
2004
Springer
15 years 8 months ago
2004
Springer
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...