Sciweavers

Share
38 search results - page 1 / 8
» Cost Based Query Scrambling for Initial Delays
Sort
View
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
12 years 8 days ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
PDIS
1996
IEEE
12 years 6 days ago
Scrambling Query Plans to Cope With Unexpected Delays
Accessing data from numerous widely-distributed sources poses signi cant new challenges for query optimization and execution. Congestion and failures in the network can introduce ...
Laurent Amsaleg, Michael J. Franklin, Anthony Toma...
ICRA
2006
IEEE
159views Robotics» more  ICRA 2006»
12 years 2 months ago
Bearing-only Landmark Initialization by using SUF with Undistorted SIFT Features
— In this paper, we present a delayed algorithm for landmark initialization based on a Scaled Unscented Filter. The algorithm efficiently gives well-conditioned feature location...
Xiang Wang, Hong Zhang
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
10 years 11 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
ICWN
2008
11 years 9 months ago
Coverage Efficient Clustering Method Based on Time Delay for Wireless Sensor Networks
Energy efficient operations are essential to increase the lifetime of wireless sensor network. A clustering-based protocol is one approach that reduces energy by a data aggregation...
Ji Gong, Hyuntae Kim, Gihwan Cho
books