Sciweavers

4781 search results - page 133 / 957
» Complexity at large
Sort
View
ANTS
2004
Springer
139views Algorithms» more  ANTS 2004»
14 years 3 months ago
Binary GCD Like Algorithms for Some Complex Quadratic Rings
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
Saurabh Agarwal, Gudmund Skovbjerg Frandsen
ISCAS
2003
IEEE
91views Hardware» more  ISCAS 2003»
14 years 3 months ago
Full-custom CMOS realization of a high-performance binary sorting engine with linear area-time complexity
The full-custom CMOS realization of a new modular sorting architecture is presented. The high-performance architecture is based on rank ordering, and on efficient implementation o...
Turan Demirci, Ilhan Hatirnaz, Yusuf Leblebici
SI3D
2003
ACM
14 years 3 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
FPL
2006
Springer
96views Hardware» more  FPL 2006»
14 years 1 months ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
ALENEX
2010
143views Algorithms» more  ALENEX 2010»
13 years 11 months ago
Navigation in Real-World Complex Networks through Embedding in Latent Spaces
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
Xiaomeng Ban, Jie Gao, Arnout van de Rijt