3702 search results - page 450 / 741 » All Pairings Are in a Group |
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Given a query on the PASCAL database maintained by the INIST, we design user interfaces to visualize and wo types of graphs extracted from abstracts: 1) the graph of all associati...
150
Voted
DCG
2010
15 years 6 months ago
2010
: We investigate polyhedral 2k-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex k-Hamiltonian if it contains the full k-skeleton o...
139
click to vote
FFA
2008
15 years 6 months ago
2008
Let Fq be a finite field and consider the polynomial ring Fq[X]. Let Q Fq[X]. A function f : Fq[X] G, where G is a group, is called strongly Q-additive, if f(AQ + B) = f(A) + f(B...
156
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
: We will study convolutional codes with the help of state space realizations. It will be shown that two such minimal realizations belong to the same code if and only if they are e...
155
click to vote
DSS
2006
15 years 6 months ago
2006
This paper describes the concept of workflow merge and methods for merging business processes. We grouped merges in four categories according to the type of merge: sequential, par...