Sciweavers

7 search results - page 1 / 2
» Approximate personal name-matching through finite-state grap...
Sort
View
JASIS
2007
125views more  JASIS 2007»
13 years 4 months ago
Approximate personal name-matching through finite-state graphs
cience Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The re...
Carmen Galvez, Félix de Moya Anegón
LREC
2010
165views Education» more  LREC 2010»
13 years 6 months ago
Improving Personal Name Search in the TIGR System
This paper describes the development and evaluation of enhancements to the specialized information retrieval capabilities of a multimodal reporting system. The system enables coll...
Keith J. Miller, Sarah McLeod, Elizabeth Schroeder...
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
14 years 5 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
13 years 10 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 5 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...