Sciweavers

1425 search results - page 230 / 285
» Beyond Dependency Graphs
Sort
View
ICPR
2002
IEEE
14 years 9 months ago
Spatial Color Component Matching of Images
Color and color neighborhood statistics have been used extensively in image matching and retrieval. However, the effective incorporation of color layout information remains a chal...
Jianying Hu, Efstathios Hadjidemetriou
ICML
2007
IEEE
14 years 8 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
WWW
2005
ACM
14 years 8 months ago
TruRank: taking PageRank to the limit
PageRank is defined as the stationary state of a Markov chain depending on a damping factor that spreads uniformly part of the rank. The choice of is eminently empirical, and in...
Sebastiano Vigna
VLSID
2005
IEEE
255views VLSI» more  VLSID 2005»
14 years 8 months ago
Estimation of Switching Activity in Sequential Circuits Using Dynamic Bayesian Networks
We propose a novel, non-simulative, probabilistic model for switching activity in sequential circuits, capturing both spatio-temporal correlations at internal nodes and higher ord...
Sanjukta Bhanja, Karthikeyan Lingasubramanian, N. ...
ICSE
2004
IEEE-ACM
14 years 8 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury