4137 search results - page 216 / 828 » On the number of matchings of a tree |
181
click to vote
CN
2006
15 years 6 months ago
2006
In this study, we investigate a cost-effective approach for protecting several multicast sessions from any link failure in an optical network. The approach, referred to as cross-s...
166
click to vote
TSP
2008
15 years 6 months ago
2008
In this paper, we present a near ML-achieving sphere decoding algorithm that reduces the number of search operations in the sphere-constrained search. Specifically, by adding a pro...
182
click to vote
ISCAS
2007
IEEE
16 years 28 days ago
2007
IEEE
Abstract— Several network security and QoS applications require detecting multiple string matches in the packet payload by comparing it against predefined pattern set. This proc...
183
click to vote
ESA
2005
Springer
16 years 2 days ago
2005
Springer
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
153
click to vote
IROS
2006
IEEE
16 years 20 days ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...