Sciweavers

1920 search results - page 157 / 384
» The Complexity of the A B C Problem
Sort
View
TIT
2011
131views more  TIT 2011»
15 years 1 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson
PODC
2009
ACM
16 years 7 months ago
Brief announcement: collaborative measurement of upload speeds in P2P systems
We define and study the bandwidth determination problem in adhoc P2P environments. Using point-to-point bandwidth probes, the goal is to quickly determine each host's upload ...
John R. Douceur, James W. Mickens, Thomas Moscibro...
ICCD
2005
IEEE
224views Hardware» more  ICCD 2005»
16 years 3 months ago
Algorithmic and Architectural Design Methodology for Particle Filters in Hardware
In this paper we present algorithmic and architectural methodology for building Particle Filters in hardware. Particle filtering is a new paradigm for filtering in presence of n...
Aswin C. Sankaranarayanan, Rama Chellappa, Ankur S...
TABLEAUX
2005
Springer
16 years 16 hour ago
Description Logics in Ontology Applications
Abstract. Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications (e.g., configuration and information...
Ian Horrocks
ASPDAC
2009
ACM
144views Hardware» more  ASPDAC 2009»
15 years 11 months ago
Complete-k-distinguishability for retiming and resynthesis equivalence checking without restricting synthesis
Iterative retiming and resynthesis is a powerful way to optimize sequential circuits but its massive adoption has been hampered by the hardness of verification. This paper tackle...
Nikolaos D. Liveris, Hai Zhou, Prithviraj Banerjee