1525 search results - page 105 / 305 » Matching with Regular Constraints |
145
Voted
DAC
2000
ACM
15 years 8 months ago
2000
ACM
The ordered tree (O-tree) representation has recently gained much interest in layout design automation. Different from previous topological representations of non-slicing floorpl...
123
click to vote
NOSSDAV
1995
Springer
15 years 7 months ago
1995
Springer
Abstract. We introduce the concept of Dynamic Rate Shaping, a technique to adapt the rate ofcompressed video bitstreams MPEG-1, MPEG2, H.261, as well as JPEG to dynamically varyi...
118
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3list-coloring. Our algorithms are based on a constraint satisfaction...
139
click to vote
BMCBI
2007
15 years 4 months ago
2007
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
159
click to vote
IPM
2007
15 years 3 months ago
2007
In this paper, we propose a multi-strategic matching and merging approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constr...