Sciweavers

232 search results - page 39 / 47
» Dynamic Graph Clustering Using Minimum-Cut Trees
Sort
View
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 7 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
IPPS
2005
IEEE
14 years 28 days ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...
EXPCS
2007
13 years 9 months ago
Pipeline spectroscopy
Pipeline Spectroscopy is a new technique that allows us to measure the cost of each cache miss. The cost of a miss is displayed (graphed) as a histogram, which represents a precis...
Thomas R. Puzak, Allan Hartstein, Philip G. Emma, ...
DAC
1997
ACM
13 years 11 months ago
COSYN: Hardware-Software Co-Synthesis of Embedded Systems
: Hardware-software co-synthesis is the process of partitioning an embedded system specification into hardware and software modules to meet performance, power and cost goals. In t...
Bharat P. Dave, Ganesh Lakshminarayana, Niraj K. J...
SIROCCO
2007
13 years 8 months ago
Labeling Schemes with Queries
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
Amos Korman, Shay Kutten