3757 search results - page 473 / 752 » The overlap number of a graph |
258
click to vote
ICDE
2000
IEEE
16 years 8 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
195
click to vote
SECON
2007
IEEE
16 years 27 days ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
183
click to vote
TMC
2008
15 years 6 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
227
click to vote
DIALM
2003
ACM
15 years 12 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
192
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
We consider the task of creating a 3-d model of a large novel environment, given only a small number of images of the scene. This is a difficult problem, because if the images are...