Sciweavers

943 search results - page 106 / 189
» How should data structures and algorithms be taught
Sort
View
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 9 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray
ICS
2010
Tsinghua U.
14 years 2 months ago
Handling task dependencies under strided and aliased references
The emergence of multicore processors has increased the need for simple parallel programming models usable by nonexperts. The ability to specify subparts of a bigger data structur...
Josep M. Pérez, Rosa M. Badia, Jesús...
PVLDB
2010
159views more  PVLDB 2010»
13 years 7 months ago
Explore or Exploit? Effective Strategies for Disambiguating Large Databases
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...
Reynold Cheng, Eric Lo, Xuan Yang, Ming-Hay Luk, X...
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 7 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
CIKM
2001
Springer
14 years 1 months ago
Managing Trust in a Peer-2-Peer Information System
Managing trust is a problem of particular importance in peer-to-peer environments where one frequently encounters unknown agents. Existing methods for trust management, that are b...
Karl Aberer, Zoran Despotovic