Sciweavers

1629 search results - page 53 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
NIPS
2001
14 years 11 months ago
An Efficient Clustering Algorithm Using Stochastic Association Model and Its Implementation Using Nanostructures
This paper describes a clustering algorithm for vector quantizers using a "stochastic association model". It offers a new simple and powerful softmax adaptation rule. Th...
Takashi Morie, Tomohiro Matsuura, Makoto Nagata, A...
ICASSP
2008
IEEE
15 years 4 months ago
Efficient assignment algorithm for mapping multidimensional signals into the physical memory
The storage requirements in data-intensive multidimensional signal processing systems have a significant impact on the system performance as well as on essential design parameter...
Ilie I. Luican, Hongwei Zhu, Florin Balasa
SEMWEB
2007
Springer
15 years 3 months ago
RDFSync: Efficient Remote Synchronization of RDF Models
In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self-Contained graphs...
Giovanni Tummarello, Christian Morbidoni, Reto Bac...
RECOMB
2007
Springer
15 years 10 months ago
An Efficient and Accurate Graph-Based Approach to Detect Population Substructure
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...
Srinath Sridhar, Satish Rao, Eran Halperin
PSB
2004
14 years 11 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini