Sciweavers

454 search results - page 47 / 91
» On improving approximate solutions by evolutionary algorithm...
Sort
View
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
16 years 1 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...
ICCAD
2008
IEEE
170views Hardware» more  ICCAD 2008»
15 years 10 months ago
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...
Shiyan Hu, Zhuo Li, Charles J. Alpert
118
Voted
SODA
2008
ACM
101views Algorithms» more  SODA 2008»
15 years 3 months ago
Adaptive local ratio
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
Julián Mestre
FOCS
2000
IEEE
15 years 5 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
AIMSA
2010
Springer
15 years 3 months ago
Expressive Approximations in DL-Lite Ontologies
Abstract. Ontology based data access (OBDA) is concerned with providing access to typically very large data sources through a mediating conceptual layer that allows one to improve ...
Elena Botoeva, Diego Calvanese, Mariano Rodriguez-...