Sciweavers

3852 search results - page 480 / 771
» Construction of Codes for Network Coding
Sort
View
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 11 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
175
Voted
ICPPW
2000
IEEE
15 years 11 months ago
Flits: Pervasive Computing for Processor and Memory Constrained Systems
Many pervasive computing software technologies are targeted for 32-bit desktop platforms. However, there are innumerable 8, 16, and 32-bit microcontroller and microprocessor-based...
William Majurski, Alden Dima, Mary Laamanen
ISSS
2000
IEEE
128views Hardware» more  ISSS 2000»
15 years 11 months ago
Hardware Synthesis from SPDF Representation for Multimedia Applications
Even though high-level hardware synthesis from dataflow graphs becomes popular in designing DSP systems, currently used dataflow models are inefficient to deal with emerging multi...
Chanik Park, Soonhoi Ha
FTDCS
1999
IEEE
15 years 11 months ago
Coordinating Open Distributed Systems
Open Distributed Systems are the dominating intellectual issue of the end of this century. Figuring out how to build those systems will become a central issue in distributed system...
Juan Carlos Cruz, Stéphane Ducasse
ICDAR
1999
IEEE
15 years 11 months 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