Sciweavers

3244 search results - page 229 / 649
» On convex complexity measures
Sort
View
EDBT
2009
ACM
100views Database» more  EDBT 2009»
15 years 11 months ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan
CMG
2001
15 years 8 months ago
Software That Can Think and Do
Rapid advances in research and technology now allow data analysis and modeling of extremely complex systems. Methods from artificial intelligence (AI) such as Neural Networks have...
Bernard Domanski
JSAC
2010
131views more  JSAC 2010»
15 years 5 months ago
Joint synchronization and localization using TOAs: A linearization based WLS solution
—Joint synchronization and localization using time of arrival (TOA) measurements is a very important research topic for many wireless ad hoc sensor network applications. For such...
Shouhong Zhu, Zhiguo Ding
SASO
2010
IEEE
15 years 4 months ago
Extracting Overlay Invariants of Distributed Systems for Autonomic System Management
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...
Hanhuai Shan, Guofei Jiang, Kenji Yoshihira
CVPR
2009
IEEE
17 years 1 months ago
SIFT-Rank: Ordinal Description for Invariant Feature Correspondence
This paper investigates ordinal image description for invariant feature correspondence. Ordinal description is a meta-technique which considers image measurements in terms of th...
Matthew Toews, William M. Wells III