4047 search results - page 167 / 810 » Some Properties and Some Problems on Set Functors |
148
Voted
INDOCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
This paper investigates a new family of RFID protocols called Ff that grew out of a proposal made at ESORICS 2007. This family has the property of having highly efficient implement...
178
Voted
GECCO
2004
Springer
16 years 11 days ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
176
Voted
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
186
click to vote
ATAL
2007
Springer
16 years 1 months ago
2007
Springer
Canonical problems are simplified representations of a class of real world problems. They allow researchers to compare algorithms in a standard setting which captures the most im...
227
click to vote
FSTTCS
2003
Springer
16 years 6 days ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...