Sciweavers

1208 search results - page 101 / 242
» On Counting Generalized Colorings
Sort
View
GLVLSI
2007
IEEE
139views VLSI» more  GLVLSI 2007»
14 years 3 months ago
Synthesis of irregular combinational functions with large don't care sets
A special logic synthesis problem is considered for Boolean functions which have large don’t care sets and are irregular. Here, a function is considered as irregular if the inpu...
Valentin Gherman, Hans-Joachim Wunderlich, R. D. M...
MFCS
2007
Springer
14 years 3 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
AAECC
2006
Springer
79views Algorithms» more  AAECC 2006»
14 years 3 months ago
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
Moshe Schwartz, Alexander Vardy
CSCW
2006
ACM
14 years 3 months ago
Sandboxes: supporting social play through collaborative multimedia composition on mobile phones
Media sharing over mobile devices is quickly becoming a common practice, used to support a variety of social processes. Most existing systems employ a model of sharing that treats...
David Fono, Scott Counts
JCDL
2006
ACM
152views Education» more  JCDL 2006»
14 years 3 months ago
Also by the same author: AKTiveAuthor, a citation graph approach to name disambiguation
The desire for definitive data and the semantic web drive for inference over heterogeneous data sources requires co-reference resolution to be performed on those data. In particul...
Duncan M. McRae-Spencer, Nigel R. Shadbolt