Sciweavers

2553 search results - page 285 / 511
» Modeling Trees with Hypertextures
Sort
View
ECOOP
2001
Springer
15 years 11 months ago
Feature Interaction and Composition Problems in Software Product Lines
Features are essential characteristic of applications within a product line. Features organized in different kinds of diagrams containing hierarchies of feature trees are closely ...
Silva Robak, Bogdan Franczyk
ISCA
2010
IEEE
214views Hardware» more  ISCA 2010»
15 years 8 months ago
Translation caching: skip, don't walk (the page table)
This paper explores the design space of MMU caches that accelerate virtual-to-physical address translation in processor architectures, such as x86-64, that use a radix tree page t...
Thomas W. Barr, Alan L. Cox, Scott Rixner
EACL
2003
ACL Anthology
15 years 8 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
BMCBI
2007
115views more  BMCBI 2007»
15 years 6 months ago
Comparing sequences without using alignments: application to HIV/SIV subtyping
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...
Gilles Didier, Laurent Debomy, Maude Pupin, Ming Z...
FOCS
2005
IEEE
16 years 5 days ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks