Sciweavers

373 search results - page 46 / 75
» Counting in Trees for Free
Sort
View
APPINF
2003
13 years 10 months ago
Corner-First Tree-based Region Broadcasting in Mesh Networks
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
Hadeel Haddad, Muhammad F. Mudawwar
ACL
1989
13 years 9 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang
INFOCOM
2012
IEEE
11 years 11 months ago
Robust multi-source network tomography using selective probes
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...
Akshay Krishnamurthy, Aarti Singh
LATA
2009
Springer
14 years 3 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
AHS
2007
IEEE
253views Hardware» more  AHS 2007»
14 years 3 months ago
evolFIR: Evolving redundancy-free FIR structures
Finite impulse response (FIR) structures are the most commonly used digital filters and can be found in various areas of everyday life. In this paper we introduce a novel approac...
Szilvia Zvada, Gabriella Kókai, Róbe...