Sciweavers

246 search results - page 43 / 50
» Graph Structure Learning for Task Ordering
Sort
View
KDD
2009
ACM
379views Data Mining» more  KDD 2009»
14 years 2 months ago
MetaFac: community discovery via relational hypergraph factorization
This paper aims at discovering community structure in rich media social networks, through analysis of time-varying, multi-relational data. Community structure represents the laten...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
CII
2008
100views more  CII 2008»
13 years 10 months ago
Knowledge formalization in experience feedback processes: An ontology-based approach
Because of the current trend of integration and interoperability of industrial systems, their size and complexity continue to grow making it more difficult to analyze, to understa...
Bernard Kamsu Foguem, Thierry Coudert, C. Bé...
DATE
2005
IEEE
115views Hardware» more  DATE 2005»
14 years 3 months ago
Functional Coverage Driven Test Generation for Validation of Pipelined Processors
Functional verification of microprocessors is one of the most complex and expensive tasks in the current system-on-chip design process. A significant bottleneck in the validatio...
Prabhat Mishra, Nikil D. Dutt
HT
2005
ACM
14 years 3 months ago
Searching a file system using inferred semantic links
We describe Eureka, a file system search engine that takes into account the inherent relationships among files in order to improve the rankings of search results. The key idea b...
Deepavali Bhagwat, Neoklis Polyzotis
CVIU
2008
180views more  CVIU 2008»
13 years 10 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...