167 search results - page 30 / 34 » A New Lower Bound for A(17, 6, 6) |
GI
2009
Springer
14 years 18 days ago
2009
Springer
: The Out-of-Home (OOH) media markets currently rely on a plethora of methods and technologies for measuring their potential or real success. From nationwide interviews over statis...
CIKM
2011
Springer
12 years 8 months ago
2011
Springer
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...
VMV
2003
13 years 9 months ago
2003
We present a novel framework for hierarchical collision detection that can be applied to virtually all bounding volume (BV) hierarchies. It allows an application to trade quality ...
FOCS
2009
IEEE
14 years 2 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...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...