5153 search results - page 698 / 1031 » Introduction to Randomized Algorithms |
165
Voted
NIPS
2004
15 years 5 months ago
2004
We present an algorithm based on convex optimization for constructing kernels for semi-supervised learning. The kernel matrices are derived from the spectral decomposition of grap...
110
click to vote
OPODIS
2004
15 years 5 months ago
2004
A network is k-connected if it remains connected after the removal of any k - 1 of its nodes. Assume that n sensors, modeled here as (omni)directional antennas, are dropped random...
163
click to vote
ICWN
2003
15 years 5 months ago
2003
: In the fourth generation wireless networks, it is believed that wireless LANs (WLANs) will interwork with cellular systems to provide fast speed data services. The integration of...
150
click to vote
IJCAI
2003
15 years 5 months ago
2003
We empirically study phase transitions of the asymmetric Traveling Salesman. Using random instances of up to 1,500 cities, we show that many properties of the problem, including t...
117
click to vote
TREC
2004
15 years 5 months ago
2004
Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text sp...