Sciweavers

7259 search results - page 152 / 1452
» From Fields to Trees
Sort
View
ICDAR
1999
IEEE
14 years 20 days ago
Information Theoretic Analysis of Postal Address Fields for Automatic Address Interpretation
This paper concerns a study of information content in postal address fields for automatic address interpretation. Information provided by a combination of address components and i...
Sargur N. Srihari, Wen-jann Yang, Venu Govindaraju
SACRYPT
1998
Springer
111views Cryptology» more  SACRYPT 1998»
14 years 17 days ago
Storage-Efficient Finite Field Basis Conversion
Abstract. This contribution proposes text for possible inclusion in IEEE P1363a specifying storageefficient finite field basis conversion techniques. Like IEEE P1363a, it is writte...
Burton S. Kaliski Jr., Yiqun Lisa Yin
WOA
2007
13 years 9 months ago
A Multi-Agent Platform Supporting Maintenance Companies on the Field
—In this paper we present the European project named E-Support, aimed to the maintenance companies which work on the field, away from the central headquarters. The main goal of E...
Andrea Passadore, Giorgio Pezzuto
CCGRID
2002
IEEE
14 years 1 months ago
End-Host Multicast Communication Using Switch-Trees Protocols
—Switch-trees are peer-to-peer algorithms for building and improving end-host multicast trees. Nodes switch parents to reduce tree cost or lower source-member latency. A node swi...
David A. Helder, Sugih Jamin
CSL
2007
Springer
14 years 8 days ago
MSO on the Infinite Binary Tree: Choice and Order
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
Arnaud Carayol, Christof Löding