19866 search results - page 273 / 3974 » Computing all factorizations in *** |
176
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
183
click to vote
NORDICHI
2004
ACM
16 years 3 days ago
2004
ACM
The primary contribution of this paper is investigating how the User Centered Design approach is integrated into the industry. Employing a structured web-survey, targeted to the u...
169
click to vote
SAC
2004
ACM
16 years 3 days ago
2004
ACM
Web cache replacement algorithms have received a lot of attention during the past years. Though none of the proposed algorithms deals efficiently with all the particularities of t...
171
click to vote
ANTS
2004
Springer
16 years 2 days ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
165
click to vote
HYBRID
2004
Springer
16 years 2 days ago
2004
Springer
The joint spectral radius of a set of matrices is a measure of the maximal asymptotic growth rate that can be obtained by forming long products of matrices taken from the set. This...