4137 search results - page 228 / 828 » On the number of matchings of a tree |
164
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
166
click to vote
HIPEAC
2007
Springer
16 years 24 days ago
2007
Springer
Computer architects and designers rely heavily on simulation. The downside of simulation is that it is very time-consuming — simulating an industry-standard benchmark on todayâ€...
230
click to vote
MIDDLEWARE
2007
Springer
16 years 24 days ago
2007
Springer
With the growing number of service advertisements in service marketplaces, there is a need for matchmakers which select and rank functionally similar services based on nonfunction...
178
click to vote
ANCS
2007
ACM
15 years 10 months ago
2007
ACM
Network operators need high-capacity router architectures that can offer scalability, provide throughput and performance guarantees, and maintain packet ordering. However, previou...
172
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...