Sciweavers

2969 search results - page 74 / 594
» A space efficient algorithm for group structure computation
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
15 years 28 days ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
VMV
2004
157views Visualization» more  VMV 2004»
15 years 4 months ago
Interactive Hierarchical Space Carving with Projector-based Calibrations
We present an interactive reconstruction system based on space carving. The user controls the camera and object positions and their impact on the reconstruction is immediately dis...
Martin Granger-Piché, Emric Epstein, Pierre...
JSC
2011
74views more  JSC 2011»
14 years 10 months ago
Constructive homomorphisms for classical groups
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
Scott H. Murray, Colva M. Roney-Dougal
SPAA
1995
ACM
15 years 6 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
PPSN
2004
Springer
15 years 8 months ago
A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Jorge Muruzábal, Carlos Cotta