Sciweavers

1071 search results - page 139 / 215
» Programming with enumerable sets of structures
Sort
View
PLDI
2012
ACM
13 years 3 months ago
Effective parallelization of loops in the presence of I/O operations
Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...
Min Feng, Rajiv Gupta, Iulian Neamtiu
EWSN
2004
Springer
15 years 6 months ago
Networked Slepian-Wolf: Theory and Algorithms
Abstract. In this paper, we consider the minimization of a relevant energy consumption related cost function in the context of sensor networks where correlated sources are generate...
Razvan Cristescu, Baltasar Beferull-Lozano, Martin...
94
Voted
COMPGEOM
2005
ACM
15 years 2 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
ISMB
1997
15 years 1 months ago
Standardized Representations of the Literature: Combining Diverse Sources of Ribosomal Data
We are building a knowledge base (KB) of published structural data on the 30s ribosomal subunit in prokaryotes. Our KB is distinguished by a standardized representation of biologi...
Russ B. Altman, Neil F. Abernethy, Richard O. Chen
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 5 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou