33 search results - page 2 / 7 » Simple deterministic wildcard matching |
189
Voted
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
175
Voted
EDBT
2009
ACM
15 years 11 months ago
2009
ACM
In a publish-subscribe system based on filtering of XML documents, subscribers specify their interests with profiles expressed in the XPath language. The system processes a stre...
170
Voted
HIPEAC
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Publish-subscribe systems present the state of the art in information dissemination to multiple users. Such systems have evolved from simple topic-based to the current XM...
165
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
206
Voted
ICALP
1991
Springer
15 years 10 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...