13214 search results - page 304 / 2643 » Pseudorandomness for network algorithms |
176
click to vote
ACL
1998
15 years 8 months ago
1998
We present an architecture and an on-line learning algorithm and apply it to the problem of part-ofspeech tagging. The architecture presented, SNOW, is a network of linear separat...
188
click to vote
SIGCOMM
2003
ACM
15 years 12 months ago
2003
ACM
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks...
185
click to vote
ICAISC
2010
Springer
15 years 8 months ago
2010
Springer
The problem of finding optimal locations of base stations, their pilot powers and channel assignments in UMTS mobile networks belongs to a class of NP-hard problems, and hence, me...
234
click to vote
ICCNMC
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. The main goal of research concerning energy aware routing algorithm for wireless sensor network is to increase the lifetime and long-term connectivity of the wireless sen...
181
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to ...