Sciweavers

549 search results - page 110 / 110
» Computing All the Best Swap Edges Distributively
Sort
View
DSD
2002
IEEE
96views Hardware» more  DSD 2002»
13 years 10 months ago
Networks on Silicon: Blessing or Nightmare?
Continuing VLSI technology scaling raises several deep submicron (DSM) problems like relatively slow interconnect, power dissipation and distribution, and signal integrity. Those ...
Paul Wielage, Kees G. W. Goossens
SPAA
2009
ACM
14 years 5 months ago
Dynamic external hashing: the limit of buffering
Hash tables are one of the most fundamental data structures in computer science, in both theory and practice. They are especially useful in external memory, where their query perf...
Zhewei Wei, Ke Yi, Qin Zhang
SIGUCCS
2006
ACM
13 years 11 months ago
Better results in mathematics lessons with a virtual personal teacher
In this paper we present the results of an experiment made with our e-librarian service ”MatES”, an e-Learning tool on fractions in mathematics. MatES allows students to enter...
Serge Linckels, Carole Dording, Christoph Meinel
COMPGEOM
2010
ACM
13 years 10 months ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen