1000 search results - page 187 / 200 » order 2011 |
131
Voted
HT
2011
ACM
14 years 29 days ago
2011
ACM
One of the key motivating factors for information providers to use personalisation is to maximise the benefit to the user in accessing their content. However, traditionally such s...
129
Voted
ICALP
2011
Springer
14 years 29 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
102
click to vote
ICALP
2011
Springer
14 years 29 days ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
154
click to vote
ICITS
2011
14 years 29 days ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
189
click to vote
ICS
2011
Tsinghua U.
14 years 29 days ago
2011
Tsinghua U.
With the fast technical improvement, flash memory based Solid State Drives (SSDs) are becoming an important part of the computer storage hierarchy to significantly improve perfo...