8431 search results - page 1200 / 1687 » Algorithmically Independent Sequences |
150
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Register allocation is NP-complete in general but can be solved in linear time for straight-line programs where each variable has at most one definition point if the bank of regis...
199
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
166
click to vote
SPIRE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
168
click to vote
WINE
2007
Springer
16 years 1 months ago
2007
Springer
We consider the problem of assigning prices to goods of fixed marginal cost in order to maximize revenue in the presence of single-minded customers. We focus in particular on the...
149
click to vote
GLOBECOM
2006
IEEE
16 years 28 days ago
2006
IEEE
—The Internet has witnessed a rapid growth in deployment of data-driven overlay network (DON) based streaming applications during recent years. In these applications, each nodes ...