3319 search results - page 106 / 664 » The topology of dark networks |
176
click to vote
UAI
1996
15 years 7 months ago
1996
In this paper we propose a family of algorithms combining treeclustering with conditioning that trade space for time. Such algorithms are useful for reasoning in probabilistic and...
305
click to vote
ICANN
2011
Springer
14 years 10 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
177
click to vote
SASO
2008
IEEE
16 years 24 days ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
158
click to vote
ICCS
2007
Springer
16 years 17 days ago
2007
Springer
Abstract. Energy efficiency is an important technology of sensor networks development. In this paper we offer a method of sensors lifetime maximizing under required level of netwo...
195
click to vote
CISS
2007
IEEE
16 years 22 days ago
2007
IEEE
— Wireless communication is a critical component of battlefield networks. Nodes in a battlefield network exist in hostile environments and thus fault-tolerance against node and...