Sciweavers

6365 search results - page 473 / 1273
» Fast Local Computation Algorithms
Sort
View
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 10 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
CLOUDCOM
2010
Springer
15 years 4 months ago
LEEN: Locality/Fairness-Aware Key Partitioning for MapReduce in the Cloud
This paper investigates the problem of Partitioning Skew1 in MapReduce-based system. Our studies with Hadoop, a widely used MapReduce implementation, demonstrate that the presence ...
Shadi Ibrahim, Hai Jin, Lu Lu, Song Wu, Bingsheng ...
SIGGRAPH
1992
ACM
15 years 11 months ago
Interval analysis for computer graphics
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
John M. Snyder
ICCV
2009
IEEE
15 years 5 months ago
BLOGS: Balanced local and global search for non-degenerate two view epipolar geometry
This work considers the problem of estimating the epipolar geometry between two cameras without needing a prespecified set of correspondences. It is capable of resolving the epipo...
Aveek S. Brahmachari, Sudeep Sarkar
IPPS
1999
IEEE
15 years 12 months ago
Better Deterministic Routing on Meshes
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
Jop F. Sibeyn