Sciweavers

517 search results - page 30 / 104
» Efficient Computation of Diverse Query Results
Sort
View
COLT
2006
Springer
15 years 1 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
EUC
2004
Springer
15 years 1 months ago
Defining Scope of Query for Location-Dependent Information Services
The demand of information services has fueled in recent years. However, the requested of correct answer in a mobile environment needs to have more attentions. This is due to the sc...
James Jayaputera, David Taniar
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
15 years 10 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
FLAIRS
2006
14 years 11 months ago
Efficient Bids on Task Allocation for Multi-Robot Exploration
We propose a real time single item auction based task allocation method for the multi-robot exploration problem and investigate new bid evaluation strategies in this domain. In th...
Sanem Sariel, Tucker R. Balch
MOBIHOC
2005
ACM
15 years 9 months ago
Efficient geographic routing in multihop wireless networks
We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proxi...
Seungjoon Lee, Bobby Bhattacharjee, Suman Banerjee