Sciweavers

791 search results - page 80 / 159
» Approximating the Maximum Sharing Problem
Sort
View
SIGECOM
2008
ACM
94views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
Optimizing query rewrites for keyword-based advertising
We consider the problem of query rewrites in the context of keyword advertisement. Given a three-layer graph consisting of queries, query rewrites, and the corresponding ads that ...
Azarakhsh Malekian, Chi-Chao Chang, Ravi Kumar, Gr...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 8 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
CORR
2006
Springer
74views Education» more  CORR 2006»
13 years 7 months ago
Scheduling Algorithms for Procrastinators
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
Michael A. Bender, Raphaël Clifford, Kostas T...
TMC
2010
152views more  TMC 2010»
13 years 6 months ago
On Multihop Distances in Wireless Sensor Networks with Random Node Locations
—Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance info...
Serdar Vural, Eylem Ekici
IPPS
1999
IEEE
14 years 1 days ago
COWL: Copy-On-Write for Logic Programs
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
Vítor Santos Costa