Sciweavers

680 search results - page 29 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
EDBT
2009
ACM
100views Database» more  EDBT 2009»
14 years 13 days 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
CCR
2008
106views more  CCR 2008»
13 years 8 months ago
Message-efficient dissemination for loop-free centralized routing
With steady improvement in the reliability and performance of communication devices, routing instabilities now contribute to many of the remaining service degradations and interru...
Haldane Peterson, Soumya Sen, Jaideep Chandrasheka...
IJCV
2002
167views more  IJCV 2002»
13 years 7 months ago
On the Consistency of Instantaneous Rigid Motion Estimation
Instantaneous camera motion estimation is an important research topic in computer vision. Although in theory more than five points uniquely determine the solution in an ideal situa...
Tong Zhang, Carlo Tomasi
ICASSP
2010
IEEE
13 years 8 months ago
Gradient descent approach for secure localization in resource constrained wireless sensor networks
Many sensor network related applications require precise knowledge of the location of constituent nodes. In these applications, it is desirable for the wireless nodes to be able t...
Ravi Garg, Avinash L. Varna, Min Wu
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
14 years 2 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman