13336 search results - page 203 / 2668 » Computer Vision: Algorithms and Applications |
134
click to vote
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
148
click to vote
SIGCOMM
1996
ACM
15 years 8 months ago
1996
ACM
Emerging indoor mobile computing environments seek to provide a user with an advanced setofcommunication-intensive applications, which require sustained quality of service in the ...
133
Voted
FCS
2006
2006
Another Algorithm for Computing Longest Common Increasing Subsequence for Two Random Input Sequences
15 years 5 months ago
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest ...
126
click to vote
JAT
2006
15 years 4 months ago
2006
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
179
click to vote
ERSHOV
2009
Springer
15 years 8 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...