11017 search results - page 28 / 2204 » Closure Systems and their Structure |
IANDC
2011
13 years 2 months ago
2011
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the ...
ICDT
2010
ACM
13 years 6 months ago
2010
ACM
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
ISPD
2003
ACM
14 years 1 months ago
2003
ACM
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
ICWE
2010
Springer
13 years 6 months ago
2010
Springer
Current recommender systems can support tourists in choosing travel products (accommodation, activities, means of transport, etc.), in planning long trips, and in profitably spendi...