465 search results - page 14 / 93 » On the Hardness of Range Assignment Problems |
91
Voted
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
Standard methods for role assignment partition the vertex set of a graph in such a way that vertices in the same class can be considered to have equivalent roles in the graph. Seve...
MVA
1996
15 years 1 months ago
1996
Segmentation of range images using superquadric entities has been pointed out by a number of researchers as a powerful approach towards object recognition. Problems exist in findi...
LCN
2006
IEEE
15 years 5 months ago
2006
IEEE
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) ...
STOC
2007
ACM
16 years 2 days ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
GECCO
2008
Springer
15 years 25 days ago
2008
Springer
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...