7930 search results - page 378 / 1586 » Greedy in Approximation Algorithms |
197
click to vote
SODA
1992
ACM
15 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...
303
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
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...
184
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
210
click to vote
WEA
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
200
click to vote
CSL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...