Sciweavers

785 search results - page 119 / 157
» Binary Join Trees
Sort
View
CLUSTER
2007
IEEE
15 years 4 months ago
Network performance model for TCP/IP based cluster computing
— A new communication model, called the PlogPT model, is proposed to predict communication performance in a commodity cluster where computing nodes communicate using TCP/IP. This...
Akihiro Nomura, Hiroya Matsuba, Yutaka Ishikawa
CVPR
2010
IEEE
15 years 3 months ago
Variational Segmentation of Elongated Volumetric Structures
We present an interactive approach for segmenting thin volumetric structures. The proposed segmentation model is based on an anisotropic weighted Total Variation energy with a glo...
Christian Reinbacher, Thomas Pock, Christian Bauer...
SSPR
2004
Springer
15 years 3 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
PCM
2001
Springer
104views Multimedia» more  PCM 2001»
15 years 2 months ago
Retrieving Landscape Images Using Scene Structural Matrix
In this paper, we present Scene Structural Matrix (SSM) and apply it to the retrieval of landscape images. The SSM captures the overall structural characteristics of the scene by i...
Guoping Qiu, S. Sudirman
IPPS
2000
IEEE
15 years 2 months ago
Complexity Bounds for Lookup Table Implementation of Factored Forms in FPGA Technology Mapping
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs, such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
Wenyi Feng, Fred J. Meyer, Fabrizio Lombardi