Sciweavers

16430 search results - page 473 / 3286
» On Computable Tree Functions
Sort
View
ICASSP
2010
IEEE
15 years 5 months ago
Building pair-wise visual word tree for efficent image re-ranking
Bag-of-visual Words (BoW) image representation is getting popular in computer vision and multimedia communities. However, experiments show that the traditional BoW representation ...
Shiliang Zhang, Qingming Huang, Yijuan Lu, Wen Gao...
ISAAC
2010
Springer
253views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut
Abstract. We consider the Steiner tree problem under a 2-stage stochastic model with recourse and finitely many scenarios (SSTP). Thereby, edges are purchased in the first stage wh...
Immanuel M. Bomze, Markus Chimani, Michael Jü...
IS
2011
14 years 10 months ago
Collection trees for event-monitoring queries
In this paper we present algorithms for building and maintaining efficient collection trees that provide the conduit to disseminate data required for processing monitoring queries...
Antonios Deligiannakis, Yannis Kotidis, Vassilis S...
SSDBM
2011
IEEE
239views Database» more  SSDBM 2011»
14 years 10 months ago
Recipes for Baking Black Forest Databases - Building and Querying Black Hole Merger Trees from Cosmological Simulations
Large-scale N-body simulations play an important role in advancing our understanding of the formation and evolution of large structures in the universe. These computations require ...
Julio López, Colin Degraf, Tiziana DiMatteo...
ENTCS
2006
110views more  ENTCS 2006»
15 years 7 months ago
First Steps in Synthetic Computability Theory
Computability theory, which investigates computable functions and computable sets, lies at the foundation of computer science. Its classical presentations usually involve a fair a...
Andrej Bauer