Sciweavers

192 search results - page 25 / 39
» Cut Points in PEG
Sort
View
STOC
2005
ACM
184views Algorithms» more  STOC 2005»
15 years 11 months ago
Coresets in dynamic geometric data streams
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
Gereon Frahling, Christian Sohler
FOCS
2008
IEEE
16 years 18 days ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
INFOCOM
2006
IEEE
16 years 5 days ago
Path Protection Routing with SRLG Constraints to Support IPTV in WDM Mesh Networks
— The distribution of broadcast TV across large provider networks has become a highly topical subject as satellite distribution capacity exhausts and competitive pressures increa...
Meeyoung Cha, Wanpracha Art Chaovalitwongse, Zihui...
ATS
1998
IEEE
170views Hardware» more  ATS 1998»
15 years 10 months ago
A Ring Architecture Strategy for BIST Test Pattern Generation
This paper presents a new effective Built-In Self Test (BIST) scheme that achieves 100% fault coverage with low area overhead, and without any modification of the circuit under tes...
Christophe Fagot, Olivier Gascuel, Patrick Girard,...
AIML
2008
15 years 7 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake