4137 search results - page 115 / 828 » On the number of matchings of a tree |
141
click to vote
VTC
2007
IEEE
16 years 22 days ago
2007
IEEE
— This paper investigates the topology formation mechanisms provided by IEEE 802.15.4 to create tree-based topologies, in the context of a multi-sink wireless sensor network. The...
130
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
193
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
151
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
This paper describes a novel approach to automatically recover corresponding feature points and epipolar geometry over two wide baseline frames. Our contributions consist of sever...
178
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. In this paper we give a fully polynomial randomized approximation scheme (FPRAS) for the number of all matchings in hypergraphs belonging to a class of sparse, uniform hy...