Sciweavers

466 search results - page 19 / 94
» Efficient Object Querying for Java
Sort
View
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
15 years 2 months ago
Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. Wh...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
CGF
2005
99views more  CGF 2005»
14 years 9 months ago
N-Buffers for efficient depth map query
We introduce the N-buffer as a tool for multiresolution depth map representation. This neighborhood buffer encodes the value and position of local depth extrema at different scale...
Xavier Décoret
TKDE
2008
234views more  TKDE 2008»
14 years 9 months ago
Probabilistic Group Nearest Neighbor Queries in Uncertain Databases
The importance of query processing over uncertain data has recently arisen due to its wide usage in many real-world applications. In the context of uncertain databases, previous wo...
Xiang Lian, Lei Chen 0002
IFSA
2007
Springer
142views Fuzzy Logic» more  IFSA 2007»
15 years 4 months ago
A New Approach for Boolean Query Processing in Text Information Retrieval
The main objective of an information retrieval system is to be effective in providing a user with relevant information in response to a query. However, especially given the inform...
Leemon C. Baird III, Donald H. Kraft
ECOOP
2006
Springer
14 years 12 months ago
Scoped Types and Aspects for Real-Time Java
Real-time systems are notoriously difficult to design and implement, and, as many real-time problems are safety-critical, their solutions must be reliable as well as efficient and ...
Chris Andreae, Yvonne Coady, Celina Gibbs, James N...