Sciweavers

1162 search results - page 71 / 233
» Minimum Cycle Bases in Graphs Algorithms and Applications
Sort
View
EUROMICRO
2002
IEEE
14 years 1 months ago
Applications for the Highly Parallel Mobile Multimedia Modem M3-DSP
The Mobile Multimedia Modem (M3)-DSP is based on a scalable, highly parallel DSP platform concept capable of delivering the processing power to create software solutions for tasks...
Michael Hosemann, Gerhard Fettweis, Vladimir Nikol...
FSTTCS
2009
Springer
14 years 28 days ago
Bounded Size Graph Clustering with Applications to Stream Processing
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
Rohit Khandekar, Kirsten Hildrum, Sujay Parekh, De...
SBCCI
2003
ACM
213views VLSI» more  SBCCI 2003»
14 years 1 months ago
Algorithms and Tools for Network on Chip Based System Design
Network on Chip (NoC) is a new paradigm for designing core based System on Chips. It supports high degree of reusability and is scalable. In this paper, an efficient Two-Step Gene...
Tang Lei, Shashi Kumar
KDD
2008
ACM
192views Data Mining» more  KDD 2008»
14 years 8 months ago
Partial least squares regression for graph mining
Attributed graphs are increasingly more common in many application domains such as chemistry, biology and text processing. A central issue in graph mining is how to collect inform...
Hiroto Saigo, Koji Tsuda, Nicole Krämer
ACMSE
2007
ACM
14 years 10 days ago
Minimizing broadcast latency in ad hoc wireless networks
Network wide broadcasting in ad-hoc wireless networks provides important control and route establishment functionality for a number of unicast and multicast protocols. In broadcas...
Shankar M. Banik, Sridhar Radhakrishnan