269 search results - page 25 / 54 » Complexity Theory Made Easy |
SIGSOFT
2006
ACM
14 years 9 months ago
2006
ACM
Models are increasingly recognized as an effective means for elaborating requirements and exploring designs. For complex systems, model building is far from an easy task. Efforts ...
MOBIHOC
2010
ACM
13 years 6 months ago
2010
ACM
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
SIGECOM
2010
ACM
14 years 1 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
COMPGEOM
2011
ACM
13 years 6 days ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...