Sciweavers

2104 search results - page 30 / 421
» Sorting with networks of data structures
Sort
View
AMAI
2007
Springer
13 years 7 months ago
Relational concept discovery in structured datasets
Relational datasets, i.e., datasets in which individuals are described both by their own features and by their relations to other individuals, arise from various sources such as d...
Marianne Huchard, Mohamed Rouane Hacene, Cyril Rou...
SIGMOD
2008
ACM
103views Database» more  SIGMOD 2008»
14 years 7 months ago
XArch: archiving scientific and reference data
Database archiving is important for the retrieval of old versions of a database and for temporal queries over the history of data. We demonstrate XArch, a management system for ma...
Heiko Müller, Ioannis Koltsidas, Peter Bunema...

Book
3022views
15 years 3 months ago
Algorithms for Programmers
"This is the (work in progress) book "Algorithms for Programmers". Publication as soon as possible, content is (modulo copy editing) close to final version. I will p...
Jörg Arndt
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
13 years 7 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
SMC
2007
IEEE
105views Control Systems» more  SMC 2007»
14 years 1 months ago
Self-organizing knowledge networks for pervasive situation-aware services
Adapting to current context of usage is of fundamental importance for pervasive computing services. As the technology for acquiring contextual information is increasingly availabl...
Matthias Baumgarten, Nicola Bicocchi, Rico Kusber,...