Sciweavers

4155 search results - page 422 / 831
» Topic-Specific Optimization and Structuring
Sort
View
IJAR
2006
89views more  IJAR 2006»
15 years 7 months ago
Learning probabilistic decision graphs
Probabilistic decision graphs (PDGs) are a representation language for probability distributions based on binary decision diagrams. PDGs can encode (context-specific) independence...
Manfred Jaeger, Jens D. Nielsen, Tomi Silander
IJFCS
2006
82views more  IJFCS 2006»
15 years 7 months ago
Routing Multiple Width Communications on the Circuit Switched Tree
Dynamically reconfigurable architectures offer extremely fast solutions to various problems. The Circuit Switched Tree (CST) is an important interconnect used to implement such ar...
Krishnendu Roy, Ramachandran Vaidyanathan, Jerry L...
230
Voted
JEA
2008
120views more  JEA 2008»
15 years 7 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
194
Voted
JQL
2008
97views more  JQL 2008»
15 years 7 months ago
Dependency-length minimization in natural and artificial languages
A wide range of evidence points to a preference for syntactic structures in which dependencies are short. Here we examine the question: what kinds of dependency configurations min...
David Temperley
ORL
2008
99views more  ORL 2008»
15 years 7 months ago
Some tractable instances of interval data minmax regret problems
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
Bruno Escoffier, Jérôme Monnot, Olivi...