2542 search results - page 321 / 509 » Computing Cartograms with Optimal Complexity |
ASIACRYPT
2009
Springer
14 years 5 months ago
2009
Springer
We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damg˚ard and Nielsen (Crypto ’00), ou...
SAC
2006
ACM
14 years 4 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
SCA
2007
14 years 1 months ago
2007
Real-time evaluation of distributed contact forces for rigid or deformable 3D objects is important for providing multi-sensory feedback in emerging real-time applications, such as...
BMCBI
2008
13 years 11 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
MOBIHOC
2009
ACM
14 years 5 months ago
2009
ACM
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...