Sciweavers

727 search results - page 112 / 146
» Private approximation of search problems
Sort
View
COMGEO
2012
ACM
12 years 5 months ago
Routing multi-class traffic flows in the plane
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
DCC
2003
IEEE
14 years 9 months ago
Linear Programming Optimization for Video Coding under Multiple Constraints
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
Yegnaswamy Sermadevi, Sheila S. Hemami
WWW
2009
ACM
14 years 10 months ago
An axiomatic approach for result diversification
Understanding user intent is key to designing an effective ranking system in a search engine. In the absence of any explicit knowledge of user intent, search engines want to diver...
Sreenivas Gollapudi, Aneesh Sharma
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 10 months ago
An exploratory study of Google Scholar
Purpose – This paper2 discusses the new scientific search service Google Scholar (GS). This search engine, intended for searching exclusively scholarly documents, will be descri...
Philipp Mayr, Anne-Kathrin Walter
ATAL
2003
Springer
14 years 3 months ago
Cooperative negotiation for soft real-time distributed resource allocation
In this paper we present a cooperative negotiation protocol that solves a distributed resource allocation problem while conforming to soft real-time constraints in a dynamic envir...
Roger Mailler, Victor R. Lesser, Bryan Horling