Sciweavers

1573 search results - page 168 / 315
» A Data Structure for Sponsored Search
Sort
View
PAMI
2011
14 years 11 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
SOFTVIS
2010
ACM
15 years 4 months ago
Heapviz: interactive heap visualization for program understanding and debugging
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
Edward Aftandilian, Sean Kelley, Connor Gramazio, ...
SSDBM
2003
IEEE
141views Database» more  SSDBM 2003»
15 years 10 months ago
The ed-tree: An Index for Large DNA Sequence Databases
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
Zhenqiang Tan, Xia Cao, Beng Chin Ooi, Anthony K. ...
INLG
2004
Springer
15 years 10 months ago
Context-Based Incremental Generation for Dialogue
This paper describes an implemented model of context-based incremental tactical generation within the Dynamic Syntax framework [1] which directly reflects dialogue phenomena such ...
Matthew Purver, Ruth Kempson
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 11 months ago
Online Sorted Range Reporting
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
Gerth Stølting Brodal, Rolf Fagerberg, Mark...