Sciweavers

3505 search results - page 508 / 701
» Information Theory and the IrisCode
Sort
View
128
Voted
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 6 months ago
Polyominoes Simulating Arbitrary-Neighborhood Zippers and Tilings
This paper provides a bridge between the classical tiling theory and cellular automata on one side, and the complex neighborhood self-assembling situations that exist in practice,...
Lila Kari, Benoît Masson
CSR
2008
Springer
15 years 6 months ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 6 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
IJAC
2002
128views more  IJAC 2002»
15 years 6 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki