3265 search results - page 417 / 653 » Representing Groups on Graphs |
192
click to vote
IBPRIA
2005
Springer
16 years 3 days ago
2005
Springer
In this paper, we propose a new method to extract moving objects from a video stream without any motion estimation. The objective is to obtain a method robust to noise, large motio...
181
click to vote
LACL
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. This paper introduces a novel approach to language processing, in which linguistic facts are represented as predicates over ranges of the intput text, usually, but not li...
167
click to vote
PACT
2005
Springer
16 years 2 days ago
2005
Springer
We describe a fragment of the hardware description language VHDL that is suitable for implementing the Advanced Encryption Standard algorithm. We then define an Information Flow a...
168
click to vote
JCDL
2004
ACM
16 years 5 hour ago
2004
ACM
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
157
click to vote
ICCSA
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This paper presents the Job Shop Scheduling Problem (JSSP) represented as the well known Satisfiabilty Problem (SAT). Even though the representation of JSSP in SAT is not...