1172 search results - page 176 / 235 » Path Algorithms on Regular Graphs |
143
click to vote
ICWE
2009
Springer
15 years 5 months ago
2009
Springer
The user observed latency of retrieving Web documents is one of
limiting factors while using the Internet as an information data source.
Prefetching became important technique ...
110
click to vote
AHSWN
2008
15 years 2 months ago
2008
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
116
click to vote
STOC
2009
ACM
15 years 8 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
108
click to vote
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
Practical data mining rarely falls exactly into the supervised learning scenario. Rather, the growing amount of unlabeled data poses a big challenge to large-scale semi-supervised...
132
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...