1291 search results - page 116 / 259 » Computing the multiplicity structure in solving polynomial s... |
111
click to vote
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
114
click to vote
ICPR
2006
IEEE
15 years 7 months ago
2006
IEEE
We describe an efficient and robust method of tracking human forearms as skin colored regions. Of special consideration in the design of this system are real-time and robustness ...
100
click to vote
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
The recognition of dynamic scenes using 3D shapes could provide useful approaches for various applications. However, the conventional 3D-shape sensing systems dedicated for such s...
112
click to vote
GD
2005
Springer
15 years 7 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
140
click to vote
DAM
1999
15 years 1 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...