Sciweavers

287 search results - page 12 / 58
» UDS: A Universal Data Structure
Sort
View
PODS
2006
ACM
137views Database» more  PODS 2006»
15 years 11 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
EDBT
2008
ACM
137views Database» more  EDBT 2008»
15 years 11 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
125
Voted
TALG
2008
131views more  TALG 2008»
14 years 11 months ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
AUSDM
2007
Springer
76views Data Mining» more  AUSDM 2007»
15 years 5 months ago
Evaluation of a Graduate Level Data Mining Course with Industry Participants
Data mining courses are increasingly being taught at many universities at both undergraduate and graduate levels. This paper reports on a new graduate level data mining course run...
Peter Christen
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
15 years 3 months ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...