1101 search results - page 118 / 221 » Comparing Computer Models Solving Number Series Problems |
111
click to vote
CONSTRAINTS
2007
14 years 11 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
121
click to vote
PAMI
2008
14 years 11 months ago
2008
We propose a geometric approach to 3D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the po...
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We present an algorithm to solve the GROUP MUTUAL EXCLUSION problem in the cache-coherent (CC) model. For the same problem in the distributed shared memory (DSM) model, Danek and ...
ACHI
2009
IEEE
15 years 6 months ago
2009
IEEE
— As cameras and storage devices have become cheaper, the number of video surveillance systems has also increased. Video surveillance was (and mostly is) done by human operators ...
EUROPAR
2004
Springer
15 years 5 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...