Sciweavers

3105 search results - page 270 / 621
» The Path-Packing Structure of Graphs
Sort
View
ICPP
1997
IEEE
15 years 8 months ago
A Register Allocation Technique Using Register Existence Graph
Optamzztng compalataon as very amportant for generatang code sequentes an order to utalaze the characterastacs of processor archatectures. One of the most essentaal optzmazataon t...
Akira Koseki, Yoshiaki Fukazawa, Hideaki Komatsu
KDD
2010
ACM
263views Data Mining» more  KDD 2010»
15 years 8 months ago
Social action tracking via noise tolerant time-varying factor graphs
Users’ behaviors (actions) in a social network are influenced by various factors such as personal interests, social influence, and global trends. However, few publications sys...
Chenhao Tan, Jie Tang, Jimeng Sun, Quan Lin, Fengj...
AIRS
2006
Springer
15 years 8 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong
CAV
2006
Springer
146views Hardware» more  CAV 2006»
15 years 8 months ago
Termination Analysis with Calling Context Graphs
We introduce calling context graphs and various static and theorem proving based analyses that together provide a powerful method for proving termination of programs written in fea...
Panagiotis Manolios, Daron Vroon
DAGM
2008
Springer
15 years 6 months ago
MAP-Inference for Highly-Connected Graphs with DC-Programming
The design of inference algorithms for discrete-valued Markov Random Fields constitutes an ongoing research topic in computer vision. Large state-spaces, none-submodular energy-fun...
Jörg H. Kappes, Christoph Schnörr