1525 search results - page 128 / 305 » Matching with Regular Constraints |
110
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
Highly regular, nanodevice based architectures have been proposed to replace pure CMOS based architectures in the emerging post CMOS era. Since bottom-up self-assembly is used to ...
165
click to vote
PLANX
2007
15 years 5 months ago
2007
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
132
click to vote
PEPM
1994
ACM
15 years 8 months ago
1994
ACM
We present an efficient base algorithm for binding-time analysis based on constraint solving and the union-find algorithm. In practice it has been used to handle all of Standard M...
143
click to vote
AAMAS
2002
Springer
15 years 3 months ago
2002
Springer
Service matchmaking among heterogeneous software agents in the Internet is usually done dynamically and must be efficient. There is an obvious trade-off between the quality and eff...
123
click to vote
ICMCS
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper proposes a single-image super-resolution scheme for enlarging low quality thumbnail images widely distributed on the web, which are often generated by downsampling plus...