Sciweavers

5022 search results - page 186 / 1005
» Data structures and problem solving using Java
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
CADE
2005
Springer
15 years 10 months ago
Privacy-Sensitive Information Flow with JML
In today's society, people have very little control over what kinds of personal data are collected and stored by various agencies in both the private and public sectors. We de...
Guillaume Dufay, Amy P. Felty, Stan Matwin
104
Voted
BMCBI
2006
172views more  BMCBI 2006»
14 years 10 months ago
BioWarehouse: a bioinformatics database warehouse toolkit
Background: This article addresses the problem of interoperation of heterogeneous bioinformatics databases. Results: We introduce BioWarehouse, an open source toolkit for construc...
Thomas J. Lee, Yannick Pouliot, Valerie Wagner, Pr...
79
Voted
IADIS
2003
14 years 11 months ago
Mobile Data Sharing and Collaboration
Problems of data retrieval and collaborative work in mobile environment are introduced. System architecture of a system solving these problems is introduced and described. A short...
Martin Klíma, Zdenek Mikovec, Pavel Slav&ia...
71
Voted
ICDM
2002
IEEE
133views Data Mining» more  ICDM 2002»
15 years 3 months ago
Estimating the number of segments in time series data using permutation tests
Segmentation is a popular technique for discovering structure in time series data. We address the largely open problem of estimating the number of segments that can be reliably di...
Kari Vasko, Hannu Toivonen