1559 search results - page 140 / 312 » Some Group Theory Problems |
116
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
125
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— Many network operators offer some type of tiered service, in which users may select only from a small set of service levels (tiers). Such a service has the potential to simplif...
131
Voted
SAC
2006
ACM
15 years 10 months ago
2006
ACM
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
128
click to vote
SPAA
2003
ACM
15 years 10 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
182
click to vote
CVPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...