Sciweavers

1078 search results - page 72 / 216
» Local and Global Relational Consistency
Sort
View
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
SPAA
1997
ACM
15 years 2 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
ACCV
2009
Springer
15 years 4 months ago
A Probabilistic Model for Correspondence Problems Using Random Walks with Restart
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
Tae Hoon Kim, Kyoung Mu Lee, Sang Uk Lee
IWSOC
2003
IEEE
117views Hardware» more  IWSOC 2003»
15 years 3 months ago
Design Considerations for Optically Connected Systems on Chip
This paper addresses some fundamental issues relating to the design of systems on chip that utilize optical interconnects. We present an information theoretical model for assessin...
Neal K. Bambha, Shuvra S. Bhattacharyya, Gary Euli...
FGCS
2006
142views more  FGCS 2006»
14 years 9 months ago
Conservation properties of multisymplectic integrators
Recent results on the local and global properties of multisymplectic discretizations of Hamiltonian PDEs are discussed. We consider multisymplectic (MS) schemes based on Fourier s...
Alvaro L. Islas, Constance M. Schober