Sciweavers

2031 search results - page 245 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
15 years 10 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
2007
ACM
196views Database» more  SIGMOD 2007»
15 years 10 months ago
Adaptive location constraint processing
An important problem for many location-based applications is the continuous evaluation of proximity relations among moving objects. These relations express whether a given set of ...
Zhengdao Xu, Hans-Arno Jacobsen
WWW
2010
ACM
15 years 5 months ago
The anatomy of an ad: structured indexing and retrieval for sponsored search
The core task of sponsored search is to retrieve relevant ads for the user’s query. Ads can be retrieved either by exact match, when their bid term is identical to the query, or...
Michael Bendersky, Evgeniy Gabrilovich, Vanja Josi...
STACS
2010
Springer
15 years 5 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
ISSTA
2009
ACM
15 years 4 months ago
Identifying semantic differences in AspectJ programs
Program differencing is a common means of software debugging. Although many differencing algorithms have been proposed for procedural and object-oriented languages like C and Ja...
Martin Th Görg, Jianjun Zhao