Sciweavers

808 search results - page 113 / 162
» On the Estimation of Join Result Sizes
Sort
View
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
12 years 24 days ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
ICRA
2007
IEEE
146views Robotics» more  ICRA 2007»
14 years 4 months ago
Inertial Navigation Aided by Monocular Camera Observations of Unknown Features
Abstract— This paper presents an algorithm which can effectively constrain inertial navigation drift using monocular camera data. It is capable of operating in unknown and large ...
Michael George, Salah Sukkarieh
IPPS
2003
IEEE
14 years 3 months ago
Continuous Compilation: A New Approach to Aggressive and Adaptive Code Transformation
Over the past several decades, the compiler research community has developed a number of sophisticated and powerful algorithms for a varierty of code improvements. While there are...
Bruce R. Childers, Jack W. Davidson, Mary Lou Soff...
AAAI
1994
13 years 11 months ago
On the Inherent Level of Local Consistency in Constraint Networks
We present a new property called constraint looseness and show how it can be used to estimate the level of local consistency of a binary constraint network. Speci cally, we presen...
Peter van Beek
PAMI
2007
166views more  PAMI 2007»
13 years 9 months ago
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract—We experimentally evaluate bagging and seven other randomizationbased approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed o...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...