Sciweavers

316 search results - page 11 / 64
» Network Generalized Hamming Weight
Sort
View
CISC
2009
Springer
174views Cryptology» more  CISC 2009»
14 years 7 months ago
Algebraic Side-Channel Attacks
Abstract. In 2002, algebraic attacks using overdefined systems of equations have been proposed as a potentially very powerful cryptanalysis technique against block ciphers. However...
Mathieu Renauld, François-Xavier Standaert
FSS
2010
102views more  FSS 2010»
14 years 6 months ago
Measuring conflict and agreement between two prioritized knowledge bases in possibilistic logic
In this paper we investigate the relationship between two prioritized knowledge bases by measuring both the conflict and the agreement between them. First of all, a quantity of co...
Guilin Qi, Weiru Liu, David A. Bell
IJCAI
2003
14 years 10 months ago
Data Clustering: Principal Components, Hopfield and Self-Aggregation Networks
We present a coherent framework for data clustering. Starting with a Hopfield network, we show the solutions for several well-motivated clustering objective functions are principa...
Chris H. Q. Ding
INFOCOM
2002
IEEE
15 years 2 months ago
Maxmin fair scheduling in wireless networks
—We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints....
Leandros Tassiulas, Saswati Sarkar
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
15 years 3 months ago
Area-constrained coverage optimization by robotic sensor networks
Abstract— This paper studies robotic sensor networks performing coverage optimization tasks with area constraints. The network coverage of the environment is a function of the ro...
Jorge Cortés