Sciweavers

866 search results - page 107 / 174
» Algorithms for Comparing Pedigree Graphs
Sort
View
ALGOSENSORS
2009
Springer
14 years 3 months ago
Link Reversal: How to Play Better to Work Less
Sensor networks, with their ad hoc deployments, node mobility, and wireless communication, pose serious challenges for developing provably correct and efficient applications. A po...
Bernadette Charron-Bost, Jennifer L. Welch, Josef ...
ICCV
2003
IEEE
14 years 11 months ago
Visual Correspondence Using Energy Minimization and Mutual Information
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
Junhwan Kim, Vladimir Kolmogorov, Ramin Zabih
ICML
2009
IEEE
14 years 10 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
WWW
2001
ACM
14 years 10 months ago
Batch rekeying for secure group communications
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
Xiaozhou (Steve) Li, Yang Richard Yang, Mohamed G....
INFOCOM
2007
IEEE
14 years 3 months ago
On Node Isolation Under Churn in Unstructured P2P Networks with Heavy-Tailed Lifetimes
— Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this ...
Zhongmei Yao, Xiaoming Wang, Derek Leonard, Dmitri...