242 search results - page 28 / 49 » A SAT-Based Algorithm for Context Matching |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
AAECC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
SIGIR
2012
ACM
11 years 10 months ago
2012
ACM
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Content-based Publish/Subscribe (CPS) is a powerful paradigm providing loosely-coupled, event-driven messaging services. Although the general CPS model is well-known, man...
FOCS
2003
IEEE
14 years 24 days ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...