1046 search results - page 83 / 210 » Approximation Algorithms for Domination Search |
113
click to vote
FUIN
2006
15 years 16 days ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
116
Voted
ICDE
2009
IEEE
15 years 7 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...
NIPS
2007
15 years 1 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
138
Voted
SDM
2012
SIAM
13 years 2 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...