Sciweavers

2814 search results - page 469 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
GIS
2007
ACM
14 years 10 months ago
Evacuation route planning: scalable heuristics
Given a transportation network, a vulnerable population, and a set of destinations, evacuation route planning identifies routes to minimize the time to evacuate the vulnerable pop...
Sangho Kim, Betsy George, Shashi Shekhar
WWW
2009
ACM
14 years 9 months ago
QuWi: quality control in Wikipedia
We propose and evaluate QuWi (Quality in Wikipedia), a framework for quality control in Wikipedia. We build upon a previous proposal by Mizzaro [11], who proposed a method for sub...
Alberto Cusinato, Vincenzo Della Mea, Francesco Di...
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
14 years 9 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
14 years 9 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 9 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