Sciweavers

1188 search results - page 124 / 238
» Generating Connectives
Sort
View
120
Voted
CVPR
2008
IEEE
16 years 5 months ago
(BP)2: Beyond pairwise Belief Propagation labeling by approximating Kikuchi free energies
Belief Propagation (BP) can be very useful and efficient for performing approximate inference on graphs. But when the graph is very highly connected with strong conflicting intera...
Ifeoma Nwogu, Jason J. Corso
ICIP
2008
IEEE
16 years 5 months ago
Receiver driven layered multicast with layer-aware forward error correction
A wide range of different capabilities and connection qualities typically characterizes receivers of mobile television services. Receiver driven layered multicast (RDLM) offers an...
Cornelius Hellge, Thomas Schierl, Thomas Wiegand
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
16 years 4 months ago
Discriminative Frequent Pattern Analysis for Effective Classification
The application of frequent patterns in classification appeared in sporadic studies and achieved initial success in the classification of relational data, text documents and graph...
Hong Cheng, Xifeng Yan, Jiawei Han, Chih-Wei Hsu
WWW
2007
ACM
16 years 4 months ago
Compiling cryptographic protocols for deployment on the web
Cryptographic protocols are useful for trust engineering in Web transactions. The Cryptographic Protocol Programming Language (CPPL) provides a model wherein trust management anno...
Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. ...
CHI
2009
ACM
16 years 4 months ago
A user study on visualizing directed edges in graphs
Graphs are often visualized using node-link representations: vertices are depicted as dots, edges are depicted as (poly)lines connecting two vertices. A directed edge running from...
Danny Holten, Jarke J. van Wijk