Sciweavers

5022 search results - page 281 / 1005
» Data structures and problem solving using Java
Sort
View
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
16 years 3 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
15 years 4 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
EDBT
2000
ACM
15 years 7 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
CIKM
2008
Springer
15 years 5 months ago
Intra-document structural frequency features for semi-supervised domain adaptation
In this work we try to bridge the gap often encountered by researchers who find themselves with few or no labeled examples from their desired target domain, yet still have access ...
Andrew Arnold, William W. Cohen
CVPR
2008
IEEE
15 years 4 months ago
Extracting smooth and transparent layers from a single image
Layer decomposition from a single image is an underconstrained problem, because there are more unknowns than equations. This paper studies a slightly easier but very useful altern...
Sai Kit Yeung, Tai-Pang Wu, Chi-Keung Tang