3105 search results - page 359 / 621 » The Path-Packing Structure of Graphs |
175
click to vote
MOBIHOC
2002
ACM
16 years 4 months ago
2002
ACM
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
155
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
170
click to vote
ECSQARU
2009
Springer
15 years 11 months ago
2009
Springer
A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from one part (the top level) toward the other (the bottom level) and where a...
122
Voted
IEEEPACT
2007
IEEE
15 years 11 months ago
2007
IEEE
Continued scaling of CMOS technology to smaller transistor sizes makes modern processors more susceptible to both transient and permanent hardware faults. Circuitlevel techniques ...
162
click to vote
EMMCVPR
2007
Springer
15 years 10 months ago
2007
Springer
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, es...