Sciweavers

195 search results - page 10 / 39
» A Riemannian approach to graph embedding
Sort
View
TPHOL
2008
IEEE
14 years 3 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
CAI
2007
Springer
14 years 3 months ago
From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
In this paper, we present an overview of algebraic graph transformation in the double pushout approach. Basic results concerning independence, parallelism, concurrency, embedding, ...
Ulrike Prange, Hartmut Ehrig
EMSOFT
2011
Springer
12 years 8 months ago
Hard-real-time scheduling of data-dependent tasks in embedded streaming applications
Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Mohamed Bamakhrama, Todor Stefanov
NIPS
2008
13 years 10 months ago
Dimensionality Reduction for Data in Multiple Feature Representations
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
VLDB
2005
ACM
82views Database» more  VLDB 2005»
14 years 2 months ago
Information Preserving XML Schema Embedding
A fundamental concern of information integration in an XML context is the ability to embed one or more source documents in a target document so that (a) the target document confor...
Philip Bohannon, Wenfei Fan, Michael Flaster, P. P...