Sciweavers

3365 search results - page 58 / 673
» Multidimensional Data Modeling for Complex Data
Sort
View
213
Voted
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 3 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
ICNP
2006
IEEE
15 years 8 months ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
APIN
2004
116views more  APIN 2004»
15 years 2 months ago
Neural Learning from Unbalanced Data
This paper describes the result of our study on neural learning to solve the classification problems in which data is unbalanced and noisy. We conducted the study on three differen...
Yi Lu Murphey, Hong Guo, Lee A. Feldkamp
GIS
1999
ACM
15 years 6 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
ICDT
2001
ACM
124views Database» more  ICDT 2001»
15 years 6 months ago
Mining for Empty Rectangles in Large Data Sets
Abstract. Many data mining approaches focus on the discovery of similar (and frequent) data values in large data sets. We present an alternative, but complementary approach in whic...
Jeff Edmonds, Jarek Gryz, Dongming Liang, Ren&eacu...