Sciweavers

877 search results - page 141 / 176
» Structural Cut Elimination
Sort
View
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 2 months ago
FAST: fast architecture sensitive tree search on modern CPUs and GPUs
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
13 years 2 months ago
Crescando
This demonstration presents Crescando, an implementation of a distributed relational table that guarantees predictable response time on unpredictable workloads. In Crescando, data...
Georgios Giannikis, Philipp Unterbrunner, Jeremy M...
CVPR
2011
IEEE
13 years 28 days ago
Reduced Epipolar Cost for Accelerated Incremental SfM
We propose a reduced algebraic cost based on pairwise epipolar constraints for the iterative refinement of a multiple view 3D reconstruction. The aim is to accelerate the intermedi...
A. L. Rodriguez, P E. Lopez-de-Teruel, A. Ruiz
INFOCOM
2011
IEEE
12 years 11 months ago
VIRO: A scalable, robust and namespace independent virtual Id routing for future networks
—In this paper we propose VIRO — a novel, virtual identifier (Id) routing paradigm for future networks. The objective is three-fold. First, VIRO directly addresses the challen...
Sourabh Jain, Yingying Chen, Zhi-Li Zhang
AIPS
2011
12 years 11 months ago
Heuristic Search for Generalized Stochastic Shortest Path MDPs
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
Andrey Kolobov, Mausam, Daniel S. Weld, Hector Gef...