Sciweavers

2137 search results - page 207 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
MLG
2007
Springer
16 years 18 days ago
Learning Graph Matching
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
Alex J. Smola
APPML
2007
92views more  APPML 2007»
15 years 6 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
LCN
2005
IEEE
16 years 1 days ago
Approximate Coverage in Wireless Sensor Networks
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
Yuzhen Liu, Weifa Liang
190
Voted
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
15 years 4 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
AINA
2007
IEEE
16 years 24 days ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein