Sciweavers

2912 search results - page 246 / 583
» Logistic Model Trees
Sort
View
165
Voted
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 10 months ago
Optimal latch mapping and retiming within a tree
We propose a technology mapping algorithm that takes existing structural technology-mapping algorithms based on dynamic programming [1,3,4] and extends them to retime pipelined cir...
Joel Grodstein, Eric Lehman, Heather Harkness, Her...
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 11 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
159
Voted
COCOON
2008
Springer
15 years 8 months ago
Haplotype Inferring Via Galled-Tree Networks Is NP-Complete
The problem of determining haplotypes from genotypes has gained considerable prominence in the research community since the beginning of the HapMap project. Here the focus is on de...
Arvind Gupta, Ján Manuch, Ladislav Stacho, ...
145
Voted
ACL
2001
15 years 7 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
159
Voted
EACL
2003
ACL Anthology
15 years 7 months ago
Well-Nested Parallelism Constraints for Ellipsis Resolution
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
Katrin Erk, Joachim Niehren