Sciweavers

3172 search results - page 62 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
EJC
2008
15 years 24 days ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
149
Voted
IJDMMM
2008
124views more  IJDMMM 2008»
15 years 22 days ago
Completing missing views for multiple sources of web media
: Combining multiple data sources, each with its own features, to achieve optimal inference has received a lot of attention in recent years. In inference from multiple data sources...
Shankara B. Subramanya, Zheshen Wang, Baoxin Li, H...
124
Voted
IJSI
2008
109views more  IJSI 2008»
15 years 22 days ago
Modular Church-Rosser Modulo: The Complete Picture
In [19], Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modula...
Jean-Pierre Jouannaud, Yoshihito Toyama
JAR
2006
101views more  JAR 2006»
15 years 21 days ago
Checking Consistency and Completeness of On-Line Product Manuals
Abstract. As products are growing more complex, so is their documentation. With an increasing number of product options, the diversity in service and maintenance procedures grows a...
Carsten Sinz, Wolfgang Küchlin, Dieter Feicht...
81
Voted
JSYML
2008
74views more  JSYML 2008»
15 years 21 days ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...