1162 search results - page 51 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
121
Voted
CHES
2010
Springer
15 years 4 months ago
2010
Springer
This paper describes and analyzes the security of a general-purpose cryptographic function design, with application in RFID tags and sensor networks. Based on these analyzes, we su...
161
click to vote
ICARIS
2007
Springer
15 years 9 months ago
2007
Springer
Today’s signature-based intrusion detection systems are reactive in nature and storage-limited. Their operation depends upon catching an instance of an intrusion or virus and en...
135
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—In hop-by-hop networks, provision of multipath routes for all nodes can improve fault tolerance and performance. In this paper we study the multipath route calculation by constr...
122
Voted
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
128
click to vote
DOCENG
2006
ACM
15 years 9 months ago
2006
ACM
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...