Sciweavers

11213 search results - page 363 / 2243
» Low-contention data structures
Sort
View
SIGSOFT
2010
ACM
15 years 4 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
PLDI
2011
ACM
14 years 9 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
ILP
1999
Springer
15 years 11 months ago
Probabilistic Relational Models
Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning...
Daphne Koller
176
Voted
ESCIENCE
2007
IEEE
16 years 1 months ago
Community Training: Partitioning Schemes in Good Shape for Federated Data Grids
In federated Data Grids, individual institutions share their data sets within a community to enable collaborative data analysis. Data access needs to be provided in a scalable fas...
Tobias Scholl, Richard Kuntschke, Angelika Reiser,...
NAR
2011
307views Computer Vision» more  NAR 2011»
15 years 1 months ago
BRENDA, the enzyme information system in 2011
The BRENDA (BRaunschweig ENzyme Database, http://www.brenda-enzymes.org) enzyme information system is the main collection of enzyme functional and property data for the scientific...
Maurice Scheer, Andreas Grote, Antje Chang, Ida Sc...