635 search results - page 64 / 127 » Some Computational Problems Related to Pseudo-intents |
COMBINATORICS
2007
14 years 9 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
105
click to vote
ECCC
2007
14 years 9 months ago
2007
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
ICIP
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
DAC
1999
ACM
15 years 10 months ago
1999
ACM
It is generally believed that there will be little more variety in CPU architectures, and thus the design of Instruction-set Architectures (ISAs) will have no role in the future o...
PERCOM
2007
ACM
15 years 9 months ago
2007
ACM
The success of RFID in supply chain management is leading many to consider more personal and pervasive deployments of this technology. Unlike industrial settings, however, deploym...