Sciweavers

19866 search results - page 3833 / 3974
» Computing all factorizations in ***
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
PASTE
2010
ACM
15 years 11 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
PLDI
2010
ACM
15 years 11 months ago
Supporting speculative parallelization in the presence of dynamic data structures
The availability of multicore processors has led to significant interest in compiler techniques for speculative parallelization of sequential programs. Isolation of speculative s...
Chen Tian, Min Feng, Rajiv Gupta
APSEC
2002
IEEE
15 years 11 months ago
iBistro: A Learning Environment for Knowledge Construction in Distributed Software Engineering Courses
We have taught several distributed software engineering project courses with students and real clients [4]. During these projects, students in Pittsburgh and Munich, Germany colla...
Andreas Braun, Allen H. Dutoit, Andreas Harrer, Be...
« Prev « First page 3833 / 3974 Last » Next »