840 search results - page 115 / 168 » The Complexity of the Extended GCD Problem |
ICDCS
2005
IEEE
14 years 2 months ago
2005
IEEE
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
DAM
2008
13 years 9 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
ICCV
2009
IEEE
15 years 2 months ago
2009
IEEE
Object detection in cluttered, natural scenes has a high
complexity since many local observations compete for object
hypotheses. Voting methods provide an efficient solution
to ...
ECCV
2002
Springer
14 years 11 months ago
2002
Springer
Principal ComponentAnalysis (PCA) has been successfully applied to construct linear models of shape, graylevel, and motion. In particular, PCA has been widely used to model the var...
ICDE
2009
IEEE
14 years 11 months ago
2009
IEEE
The vast majority of work on skyline queries considers totally ordered domains, whereas in many applications some attributes are partially ordered, as for instance, domains of set ...