Sciweavers

4541 search results - page 112 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
DL
2000
Springer
210views Digital Library» more  DL 2000»
15 years 3 months ago
Extracting and visualizing semantic structures in retrieval results for browsing
The paper introduces an approach that organizes retrieval results semantically and displays them spatially for browsing. Latent Semantic Analysis as well as cluster techniques are...
Katy Börner
SIGMOD
2003
ACM
141views Database» more  SIGMOD 2003»
15 years 11 months ago
QC-Trees: An Efficient Summary Structure for Semantic OLAP
Recently, a technique called quotient cube was proposed as a summary structure for a data cube that preserves its semantics, with applications for online exploration and visualiza...
Laks V. S. Lakshmanan, Jian Pei, Yan Zhao
TKDE
2002
148views more  TKDE 2002»
14 years 11 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...
EMNLP
2010
14 years 9 months ago
Efficient Graph-Based Semi-Supervised Learning of Structured Tagging Models
We describe a new scalable algorithm for semi-supervised training of conditional random fields (CRF) and its application to partof-speech (POS) tagging. The algorithm uses a simil...
Amarnag Subramanya, Slav Petrov, Fernando Pereira
IPPS
2007
IEEE
15 years 5 months ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...