Sciweavers

14 search results - page 1 / 3
» Generalized Reduction to Compute Toric Ideals
Sort
View
ISAAC
2009
Springer
121views Algorithms» more  ISAAC 2009»
14 years 5 months ago
Generalized Reduction to Compute Toric Ideals
Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since...
Deepanjan Kesh, Shashank K. Mehta
STOC
2002
ACM
126views Algorithms» more  STOC 2002»
14 years 11 months ago
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
We give polynomial-time quantum algorithms for three problems from computational algebraic number theory. The first is Pell's equation. Given a positive nonsquare integer d, ...
Sean Hallgren
ISCA
2008
IEEE
201views Hardware» more  ISCA 2008»
13 years 11 months ago
iDEAL: Inter-router Dual-Function Energy and Area-Efficient Links for Network-on-Chip (NoC) Architectures
Network-on-Chip (NoC) architectures have been adopted by a growing number of multi-core designs as a flexible and scalable solution to the increasing wire delay constraints in the...
Avinash Karanth Kodi, Ashwini Sarathy, Ahmed Louri
ISCA
2007
IEEE
111views Hardware» more  ISCA 2007»
14 years 5 months ago
Express virtual channels: towards the ideal interconnection fabric
Due to wire delay scalability and bandwidth limitations inherent in shared buses and dedicated links, packet-switched on-chip interconnection networks are fast emerging as the per...
Amit Kumar 0002, Li-Shiuan Peh, Partha Kundu, Nira...
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 11 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen