Sciweavers

514 search results - page 49 / 103
» Multiplicative structures in additively large sets
Sort
View
IJCNN
2007
IEEE
14 years 2 months ago
Spectral Clustering of Synchronous Spike Trains
— In this paper a clustering algorithm that learns the groups of synchronized spike trains directly from data is proposed. Clustering of spike trains based on the presence of syn...
António R. C. Paiva, Sudhir Rao, Il Park, J...
IWOMP
2007
Springer
14 years 1 months ago
Support for Fine Grained Dependent Tasks in OpenMP
OpenMP is widely used for shared memory parallel programming and is especially useful for the parallelisation of loops. When it comes to task parallelism, however, OpenMP is less p...
Oliver Sinnen, Jsun Pe, Alexander Vladimirovich Ko...
VLDB
1990
ACM
179views Database» more  VLDB 1990»
13 years 11 months ago
On Indexing Line Segments
In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight li...
H. V. Jagadish
EOR
2006
86views more  EOR 2006»
13 years 7 months ago
Minimum-distance controlled perturbation methods for large-scale tabular data protection
National Statistical Agencies routinely release large amounts of tabular information. Prior to dissemination, tabular data needs to be processed to avoid the disclosure of individ...
Jordi Castro
BMCBI
2006
133views more  BMCBI 2006»
13 years 7 months ago
An integrated approach to the prediction of domain-domain interactions
Background: The development of high-throughput technologies has produced several large scale protein interaction data sets for multiple species, and significant efforts have been ...
Hyunju Lee, Minghua Deng, Fengzhu Sun, Ting Chen