562 search results - page 79 / 113 » Dependency Pairs Revisited |
140
click to vote
WFLP
2009
Springer
15 years 6 months ago
2009
Springer
Context-sensitive rewriting is a restriction of rewriting that can be used to elegantly model declarative specification and programming languages such as Maude. Furthermore, it ca...
103
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
MOBICOM
2009
ACM
15 years 6 months ago
2009
ACM
We address the connectivity of large-scale ad hoc cognitive radio networks, where secondary users exploit channels temporarily and locally unused by primary users and the existenc...
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
In many applications, it is often desirable to extract a consistent key from a multimedia object (e.g., an image), even when the object has gone through a noisy channel. For examp...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper presents a new variant of the classical Iterative Closest Point (ICP) algorithm. The ICP result depends heavily on the matching between 3D points of the two cloud of po...