1632 search results - page 96 / 327 » On special numberings of hypergraphs |
149
click to vote
CHI
2008
ACM
16 years 6 months ago
2008
ACM
The Renaissance ideal can be expressed as a creative synthesis between cultural disciplines, standing in stark contrast to our traditional focus on scientific specialization. This...
168
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
148
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
187
click to vote
ECIR
2009
Springer
16 years 3 months ago
2009
Springer
Understanding the intent underlying user queries may help personalize search results and improve user satisfaction. In this paper, we develop a methodology for using ad clickthroug...
176
click to vote
SOFSEM
2010
Springer
16 years 1 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...