252 search results - page 24 / 51 » Decremental Clique Problem |
DAM
2008
14 years 9 months ago
2008
We consider the vertex coloring problem, which may be stated as the problem of minimizing the number of labels that can be assigned to the vertices of a graph G such that each ver...
FUN
2007
Springer
15 years 1 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
121
click to vote
PKC
2012
Springer
13 years 1 days ago
2012
Springer
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
75
Voted
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper introduces a new stochastic surface model for deformable 3D surfaces and demonstrates its utility for the purpose of 3D sculpting. This is the problem of simple-touse a...
CVPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Second-order priors on the smoothness of 3D surfaces are a better model of typical scenes than first-order priors. However, stereo reconstruction using global inference algorithm...