Results 1  10
of
347,405
Partially Complemented Representations of Digraphs
, 2002
"... A complementation operation on a vertex of a digraph changes all outgoing arcs into nonarcs, and outgoing nonarcs into arcs. This defines an equivalence relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given an adjacenc ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
A complementation operation on a vertex of a digraph changes all outgoing arcs into nonarcs, and outgoing nonarcs into arcs. This defines an equivalence relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given
ModelDriven Data Acquisition in Sensor Networks
 IN VLDB
, 2004
"... Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor ..."
Abstract

Cited by 442 (36 self)
 Add to MetaCart
readings onto physical reality, a model of that reality is required to complement the readings. In this paper, we enrich interactive sensor querying with statistical modeling techniques. We demonstrate that such models can help provide answers that are both more meaningful, and, by introducing
Digit Set Conversion from Redundant Number System into Complement Representation
"... Redundant number system was proposed in order to solve the carrypropagation problem. Although it provides a carryfree parallel addition, this representation requires a lot of space to store itself. Many conversions from the redundant number system into another number representation have been intr ..."
Abstract
 Add to MetaCart
introduced to decrease the storage usage. This paper proposes a generic algorithm in order to convert the redundant number representation into the complement number representation. The proposed algorithm can perform the conversion of a number in any integer radix and eliminates the carry chain
Attributive concept descriptions with complements
 ARTIFICIAL INTELLIGENCE 48 (1991) 126
, 1991
"... We investigate the consequences of adding unions and complements to attributive concept descriptions employed in terminological knowledge representation languages. It is shown that deciding coherence and subsumption of such descriptions are PSPACEcomplete problems that can be decided with linear sp ..."
Abstract

Cited by 225 (2 self)
 Add to MetaCart
We investigate the consequences of adding unions and complements to attributive concept descriptions employed in terminological knowledge representation languages. It is shown that deciding coherence and subsumption of such descriptions are PSPACEcomplete problems that can be decided with linear
A Framework for Expressing the Relationships Between Multiple Views in Requirements Specification
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1994
"... Composite systems are generally comprised of heterogeneous components whose specifications are developed by many development participants. The requirements of such systems are invariably elicited from multiple perspectives which overlap, complement and contradict each other. Furthermore, these requi ..."
Abstract

Cited by 353 (38 self)
 Add to MetaCart
Composite systems are generally comprised of heterogeneous components whose specifications are developed by many development participants. The requirements of such systems are invariably elicited from multiple perspectives which overlap, complement and contradict each other. Furthermore
Improving the fisher kernel for largescale image classification
 IN: ECCV
, 2010
"... The Fisher kernel (FK) is a generic framework which combines the benefits of generative and discriminative approaches. In the context of image classification the FK was shown to extend the popular bagofvisualwords (BOV) by going beyond count statistics. However, in practice, this enriched repres ..."
Abstract

Cited by 341 (19 self)
 Add to MetaCart
representation has not yet shown its superiority over the BOV. In the first part we show that with several wellmotivated modifications over the original framework we can boost the accuracy of the FK. On PASCAL VOC 2007 we increase the Average Precision (AP) from 47.9 % to 58.3%. Similarly, we demonstrate state
A Low Power Adaptive Filter Using Dynamic Reduced 2'sComplement Representation
 in Proceedings, 2002 CICC
, 2002
"... We describe the IC implementation and testing of a lowpower adaptive FIR filter. A new technique is used in its implementation, one that can be employed in other digital signal processing applications where input signals have large dynamic ranges. We propose the use of a reduced 2's complement ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
signal representation to conditionally disable the internal signal transitions in the mostsignificantbits of a data path. The key idea is to generate the signal representation dynamically technique retains all of the easytoimplement properties of the widelyused 2's complement number
The Use of Reduced Two'sComplement Representation in LowPower DSP Design
 in Proc. 2002 IEEE Int. Symp. Circuits and Systems
, 2002
"... Two's complement signal representation is widely used in the implementation of arithmetic operations. However, it is wellknown that its signextension can cause undesirable signal transitions in the MSBs of a datapath circuit. We propose a novel technique to reduce the signal transitions due ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Two's complement signal representation is widely used in the implementation of arithmetic operations. However, it is wellknown that its signextension can cause undesirable signal transitions in the MSBs of a datapath circuit. We propose a novel technique to reduce the signal transitions due
Discovery of Inference Rules for Question Answering
 Natural Language Engineering
, 2001
"... One of the main challenges in questionanswering is the potential mismatch between the expressions in questions and the expressions in texts. While humans appear to use inference rules such as “X writes Y ” implies “X is the author of Y ” in answering questions, such rules are generally unavailable ..."
Abstract

Cited by 307 (7 self)
 Add to MetaCart
One of the main challenges in questionanswering is the potential mismatch between the expressions in questions and the expressions in texts. While humans appear to use inference rules such as “X writes Y ” implies “X is the author of Y ” in answering questions, such rules are generally unavailable to questionanswering systems due to the inherent difficulty in constructing them. In this paper, we present an unsupervised algorithm for discovering inference rules from text. Our algorithm is based on an extended version of Harris ’ Distributional Hypothesis, which states that words that occurred in the same contexts tend to be similar. Instead of using this hypothesis on words, we apply it to paths in the dependency trees of a parsed corpus. Essentially, if two paths tend to link the same set of words, we hypothesize that their meanings are similar. We use examples to show that our system discovers many inference rules easily missed by humans. 1
Decidable reasoning in terminological knowledge representation systems
 Journal of Artificial Intelligence Research
, 1993
"... Terminological Knowledge Representation Systems (TKRSs) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). The TKRS we consider in this paper is of practical interest since it goes beyond the capabilities of presently available TKRSs. ..."
Abstract

Cited by 201 (13 self)
 Add to MetaCart
Terminological Knowledge Representation Systems (TKRSs) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). The TKRS we consider in this paper is of practical interest since it goes beyond the capabilities of presently available TKRSs
Results 1  10
of
347,405