3131 search results - page 384 / 627 » Generalized connection caching |
178
click to vote
DM
2008
15 years 5 months ago
2008
A Skolem sequence is a sequence s1, s2, . . . , s2n (where si A = {1 . . . n}), each si occurs exactly twice in the sequence and the two occurrences are exactly si positions apar...
164
click to vote
JCO
2010
15 years 5 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
186
click to vote
TCS
2010
15 years 5 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
171
click to vote
AIRS
2010
Springer
15 years 4 months ago
2010
Springer
This paper is concerned with relevance ranking in search, particularly that using term dependency information. It proposes a novel and unified approach to relevance ranking using ...
158
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
Wire bonding is the most popular method to connect signals between dies in System-in-Package (SiP) design nowadays. Pad assignment, which assigns inter-die signals to die pads so ...