Sciweavers

3396 search results - page 60 / 680
» Tree representations of graphs
Sort
View
AFRIGRAPH
2001
ACM
15 years 4 months ago
Real time isosurface browsing
: Cross-sectioning is a popular method for visualizing the complicated inner structures of three-dimensional volume datasets. However, the process is usually manual, meaning that a...
Caleb Lyness, Edwin H. Blake
119
Voted
TCS
2010
14 years 11 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
ICASSP
2011
IEEE
14 years 4 months ago
A comparative analysis of dynamic network decoding
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
David Rybach, Ralf Schlüter, Hermann Ney
EMNLP
2010
14 years 10 months ago
Title Generation with Quasi-Synchronous Grammar
The task of selecting information and rendering it appropriately appears in multiple contexts in summarization. In this paper we present a model that simultaneously optimizes sele...
Kristian Woodsend, Yansong Feng, Mirella Lapata
91
Voted
SWAT
1994
Springer
126views Algorithms» more  SWAT 1994»
15 years 4 months ago
Optimal Parametric Search on Graphs of Bounded Tree-Width
We give linear-time algorithms for a class of parametric search problems on weighted graphs of bounded tree-width. We also discuss the implications of our results to approximate p...
David Fernández-Baca, Giora Slutzki