Sciweavers

206 search results - page 32 / 42
» A nonblocking set optimized for querying the minimum value
Sort
View
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
14 years 2 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
JMLR
2006
125views more  JMLR 2006»
13 years 7 months ago
Efficient Learning of Label Ranking by Soft Projections onto Polyhedra
We discuss the problem of learning to rank labels from a real valued feedback associated with each label. We cast the feedback as a preferences graph where the nodes of the graph ...
Shai Shalev-Shwartz, Yoram Singer
IJRR
2007
104views more  IJRR 2007»
13 years 7 months ago
Deep Space Formation Flying Spacecraft Path Planning
Efficient algorithms for collision-free energy sub-optimal path planning for formations of spacecraft flying in deep space are presented. The idea is to introduce a set of way-poi...
Cornel Sultan, Sanjeev Seereeram, Raman K. Mehra
PODS
2004
ACM
207views Database» more  PODS 2004»
14 years 8 months ago
Adaptive Sampling for Geometric Problems over Data Streams
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
John Hershberger, Subhash Suri
CIKM
2009
Springer
14 years 2 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...