103 search results - page 7 / 21 » Representations of graphs modulo n |
125
Voted
3DOR
2009
15 years 4 months ago
2009
Most of the approaches which address the problem of 3D object retrieval, use global descriptors of the objects which fail to consistently compensate for the intra-class variabilit...
120
Voted
CANS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
99
Voted
DAC
2000
ACM
16 years 4 months ago
2000
ACM
Joint module selection and retiming is a powerful technique to optimize the implementation cost and the speed of a circuit specified using a synchronous data-flow graph (DFG). In ...
149
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
179
Voted
CORR
2007
Springer
15 years 3 months ago
2007
Springer
—We consider point to point link scheduling in Spatial Time Division Multiple Access (STDMA) wireless networks under the physical interference model. We propose a novel link sche...