1022 search results - page 10 / 205 » New models and algorithms for programmable networks |
113
click to vote
ICC
2009
IEEE
15 years 8 months ago
2009
IEEE
—Random walk (RW) has been widely used as a strategy for searching in peer-to-peer networks. The boom of social network applications introduces new impact to the classical algori...
148
click to vote
CORR
2012
Springer
13 years 9 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
141
click to vote
IISWC
2008
IEEE
15 years 8 months ago
2008
IEEE
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
140
click to vote
HPCC
2007
Springer
15 years 5 months ago
2007
Springer
In wireless sensor networks with many-to-one transmission mode, a multi-objective TDMA (Time Division Multiple Access) scheduling model is presented, which concerns about the packe...
128
click to vote
FGCN
2008
IEEE
15 years 8 months ago
2008
IEEE
A new distributed algorithm of data ccompression based on hierarchical cluster model for sensor networks is proposed, the basic ideas of which are as follows, firstly the whole se...