4255 search results - page 734 / 851 » Cover |
167
click to vote
APPROX
2009
Springer
16 years 12 hour ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
142
click to vote
WINE
2009
Springer
16 years 6 hour ago
2009
Springer
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
141
click to vote
WISA
2009
Springer
16 years 6 hour ago
2009
Springer
Wireless mesh networks (WMNs) that are being increasingly deployed in communities and public places provide a relatively stable routing infrastructure and can be used for diverse c...
131
click to vote
CIKM
2009
Springer
15 years 12 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
151
click to vote
CIKM
2009
Springer
15 years 12 months ago
2009
Springer
Wikipedia is the largest monolithic repository of human knowledge. In addition to its sheer size, it represents a new encyclopedic paradigm by interconnecting articles through hyp...