Sciweavers

469 search results - page 48 / 94
» Directed Graphs of Entanglement Two
Sort
View
ICALT
2006
IEEE
14 years 1 months ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
ICMCS
2005
IEEE
148views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Compressed Domain Image Indexing and Retrieval Based on the Minimal Spanning Tree
In this paper, a method for content-based retrieval of JPEG images is presented, utilizing features directly from the discrete cosine transform (DCT) domain. Image indexing is ach...
Christos Theoharatos, Vassilios K. Pothos, George ...
PCI
2005
Springer
14 years 1 months ago
Scenario Networks: Specifying User Interfaces with Extended Use Cases
In this paper, we present the rationale and the baseline of a notation which can be used on its own or as an extension to standard UML to facilitate specification of an interactive...
Demosthenes Akoumianakis, Ioannis Pachoulakis
IPPS
1999
IEEE
13 years 12 months ago
Scalable Parallelization of Harmonic Balance Simulation
Abstract. A new approach to parallelizing harmonic balance simulation is presented. The technique leverages circuit substructure to expose potential parallelism in the form of a di...
David L. Rhodes, Apostolos Gerasoulis
CIE
2009
Springer
13 years 11 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch