Sciweavers

6542 search results - page 1030 / 1309
» The tao of parallelism in algorithms
Sort
View
ICML
1997
IEEE
16 years 7 months ago
Predicting Multiprocessor Memory Access Patterns with Learning Models
Machine learning techniques are applicable to computer system optimization. We show that shared memory multiprocessors can successfully utilize machine learning algorithms for mem...
M. F. Sakr, Steven P. Levitan, Donald M. Chiarulli...
ISBI
2008
IEEE
16 years 7 months ago
Pathological image segmentation for neuroblastoma using the GPU
We present a novel use of GPUs (Graphics Processing Units) for the analysis of histopathologicalimages of neuroblastoma, a childhood cancer. Thanks to the advent of modern microsc...
Antonio Ruiz, Jun Kong, Manuel Ujaldon, Kim L. Boy...
ICDT
2009
ACM
121views Database» more  ICDT 2009»
16 years 7 months ago
Optimal splitters for database partitioning with size bounds
Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (o...
Kenneth A. Ross, John Cieslewicz
RECOMB
2007
Springer
16 years 7 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
CADE
2006
Springer
16 years 7 months ago
Inferring Network Invariants Automatically
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
Olga Grinchtein, Martin Leucker, Nir Piterman
« Prev « First page 1030 / 1309 Last » Next »