736 search results - page 88 / 148 » Approximating the Number of Network Motifs |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that m...
IJCAT
2010
14 years 8 months ago
2010
: The task of 3D shape classification is to assign a set of unordered shapes into pre-tagged classes with class labels, and find the most suitable class for a newly given shape. In...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Single-Symbol Maximum Likelihood (ML) decodable Distributed Orthogonal Space-Time Block Codes (DOSTBCs) have been introduced recently for cooperative networks and an up...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Finding a reliable and efficient routing path in vehicular ad hoc networks (VANETs) is a challenging issue due to high mobility of vehicles and frequent link breakage. Motivat...