Sciweavers

486 search results - page 48 / 98
» What was the Query
Sort
View
DMSN
2004
ACM
15 years 11 months ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
NIPS
2007
15 years 6 months ago
Active Preference Learning with Discrete Choice Data
We propose an active learning algorithm that learns a continuous valuation model from discrete preferences. The algorithm automatically decides what items are best presented to an...
Eric Brochu, Nando de Freitas, Abhijeet Ghosh
NDQA
2003
123views Education» more  NDQA 2003»
15 years 6 months ago
HITIQA: A Data Driven Approach to Interactive Question Answering: A Preliminary Report
HITIQA is an interactive question answering technology designed to allow intelligence analysts and other users of information systems to pose questions in natural language and obt...
Sharon Small, Nobuyuki Shimizu, Tomek Strzalkowski...
IPM
2011
91views more  IPM 2011»
14 years 8 months ago
Measuring the interestingness of articles in a limited user environment
Abstract-Search engines, such as Google, assign scores to news articles based on their relevancy to a query. However, not all relevant articles for the query may be interesting to ...
Raymond K. Pon, Alfonso F. Cardenas, David Buttler...
COMPGEOM
2005
ACM
15 years 7 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg