Sciweavers

172 search results - page 21 / 35
» On the cost of searching signature trees
Sort
View
SIGMOD
2009
ACM
218views Database» more  SIGMOD 2009»
14 years 7 months ago
Exploring biomedical databases with BioNav
We demonstrate the BioNav system, a novel search interface for biomedical databases, such as PubMed. BioNav enables users to navigate large number of query results by categorizing...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...
KDD
2010
ACM
257views Data Mining» more  KDD 2010»
13 years 11 months ago
Multi-task learning for boosting with application to web search ranking
In this paper we propose a novel algorithm for multi-task learning with boosted decision trees. We learn several different learning tasks with a joint model, explicitly addressing...
Olivier Chapelle, Pannagadatta K. Shivaswamy, Srin...
ADHOCNOW
2009
Springer
14 years 2 months ago
Auction Aggregation Protocols for Wireless Robot-Robot Coordination
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...
Ivan Mezei, Veljko Malbasa, Ivan Stojmenovic
ICDE
2009
IEEE
184views Database» more  ICDE 2009»
14 years 2 months ago
Scalable Keyword Search on Large Data Streams
Abstract— It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new ...
Lu Qin, Jeffrey Xu Yu, Lijun Chang, Yufei Tao
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 3 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach