Sciweavers

4536 search results - page 155 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ICDIM
2008
IEEE
14 years 3 months ago
A fast approximate algorithm for large-scale Latent Semantic Indexing
Latent Semantic Indexing (LSI) is an effective method to discover the underlying semantic structure of data. It has numerous applications in information retrieval and data mining....
Dell Zhang, Zheng Zhu
ICANN
2007
Springer
14 years 3 months ago
Structure Learning with Nonparametric Decomposable Models
Abstract. We present a novel approach to structure learning for graphical models. By using nonparametric estimates to model clique densities in decomposable models, both discrete a...
Anton Schwaighofer, Mathäus Dejori, Volker Tr...
CIKM
2008
Springer
13 years 11 months ago
Estimating the number of answers with guarantees for structured queries in p2p databases
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
Marcel Karnstedt, Kai-Uwe Sattler, Michael Ha&szli...
NIPS
1994
13 years 10 months ago
Factorial Learning and the EM Algorithm
Many real world learning problems are best characterized by an interaction of multiple independent causes or factors. Discovering such causal structure from the data is the focus ...
Zoubin Ghahramani
ICPR
2002
IEEE
14 years 10 months ago
Hexagonal Image Representation for 3-D Photorealistic Reconstruction
A new data structure for representing the color of rays from multiple-view images is presented. The structure is a hexagonal tessellation generated from a buckyball. Using the str...
Hidenori Sato, Hiroto Matsuoka, Akira Onozawa, Hit...