Sciweavers

2629 search results - page 113 / 526
» complex 2009
Sort
View
67
Voted
LATA
2009
Springer
15 years 7 months ago
Automata on Gauss Words
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
Alexei Lisitsa, Igor Potapov, Rafiq Saleh
131
Voted
DDECS
2009
IEEE
202views Hardware» more  DDECS 2009»
15 years 7 months ago
Asynchronous two-level logic of reduced cost
— We propose a novel synthesis method of a dual-rail asynchronous two-level logic of reduced cost. It is based on a model that operates under so called modified weak constraints....
Igor Lemberski, Petr Fiser
98
Voted
DEXAW
2009
IEEE
171views Database» more  DEXAW 2009»
15 years 7 months ago
Ontology Knowledge Authoring by Natural Language Empowerment
One of the main limitations in using ontologies in modern information systems is due to the fact that the design and maintenance of ontologies is a complex activity that requires ...
Alfio Ferrara, Stefano Montanelli, Gaia Varese, Si...
115
Voted
DSD
2009
IEEE
387views Hardware» more  DSD 2009»
15 years 7 months ago
Architecture and DSP Implementation of a DVB-S2 Baseband Demodulator
—This paper presents the design and implementation of a baseband demodulator for DVB-S2 satellite receivers. In order to meet the requirements of different complex and multidomai...
Panayiotis Savvopoulos, Nikolaos Papandreou, Theod...
81
Voted
FOCS
2009
IEEE
15 years 7 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...