1162 search results - page 173 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ICCAD
2001
IEEE
14 years 4 months ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles...
GIS
2008
ACM
14 years 9 months ago
2008
ACM
The application domain of intelligent transportation is plagued by a shortage of data sources that adequately assess traffic situations. Typically, to provide routing and navigati...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...