4137 search results - page 667 / 828 » On the number of matchings of a tree |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
VLDB
2008
ACM
14 years 8 months ago
2008
ACM
With the commoditization of digital devices, personal information and media sharing is becoming a key application on the pervasive Web. In such a context, data annotation rather th...
SIGMOD
2007
ACM
14 years 8 months ago
2007
ACM
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Cardinality estimation during query optimization relies on simplifying assumptions that usually do not hold in practice. To diminish the impact of inaccurate estimates during opti...