Sciweavers

9209 search results - page 310 / 1842
» Data Space Randomization
Sort
View
AUTOMATICA
2006
109views more  AUTOMATICA 2006»
15 years 6 months ago
Closed-loop subspace identification using the parity space
It is known that many subspace algorithms give biased estimates for closed-loop data due to the existence of feedback. In this paper we present a new subspace identification metho...
Jin Wang, S. Joe Qin
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 6 months ago
Dirac Notation, Fock Space and Riemann Metric Tensor in Information Retrieval Models
Using Dirac Notation as a powerful tool, we investigate the three classical Information Retrieval (IR) models and some their extensions. We show that almost all such models can be...
Xing M. Wang
PUC
2002
80views more  PUC 2002»
15 years 6 months ago
Overcoming the Lack of Screen Space on Mobile Computers
One difficulty for interface design on mobile computers is lack of screen space caused by their small size. This paper describes a small pilot study and two formal experiments tha...
Stephen A. Brewster
TKDE
2002
124views more  TKDE 2002»
15 years 6 months ago
Clustering for Approximate Similarity Search in High-Dimensional Spaces
In this paper we present a clustering and indexing paradigm called Clindex for high-dimensional search spaces. The scheme is designed for approximate similarity searches, where on...
Chen Li, Edward Y. Chang, Hector Garcia-Molina, Gi...
TODS
2002
92views more  TODS 2002»
15 years 6 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella