Sciweavers

605 search results - page 14 / 121
» Parameterized Dynamic Tables
Sort
View
SIPS
2007
IEEE
15 years 4 months ago
Efficient Function Evaluations with Lookup Tables for Structured Matrix Operations
A hardware ef cient approach is introduced for elementary function evaluations in certain structured matrix computations. It is a comprehensive approach that utilizes lookup table...
Kanwaldeep Sobti, Lanping Deng, Chaitali Chakrabar...
DSOM
2006
Springer
15 years 2 months ago
Towards Distributed Hash Tables (De)Composition in Ambient Networks
When different wireless networks come in close proximity there is often a need for them to logically combine, or compose. We focus on a known research problem particularly in Ambie...
Lawrence Cheng, Roel Ocampo, Kerry Jean, Alex Gali...
JPDC
2010
133views more  JPDC 2010»
14 years 5 months ago
Lock-free parallel dynamic programming
We show a method for parallelizing top down dynamic programs in a straightforward way by a careful choice of a lock-free shared hash table implementation and randomization of the ...
Alex Stivala, Peter J. Stuckey, Maria Garcia de la...
79
Voted
PODC
2003
ACM
15 years 3 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
ICC
2000
IEEE
179views Communications» more  ICC 2000»
15 years 2 months ago
A Comparison of On-Demand and Table Driven Routing for Ad-Hoc Wireless Networks
—We introduce WRP-Lite, which is a table-driven routing protocol that uses non-optimal routes, and compare its performance with the performance of the dynamic source routing (DSR...
Jyoti Raju, J. J. Garcia-Luna-Aceves