2314 search results - page 123 / 463 » Monoids over domains |
108
click to vote
CORR
2004
Springer
15 years 1 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
114
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
CAV
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
116
click to vote
ICCAD
2001
IEEE
15 years 10 months ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
122
Voted
ICPP
2007
IEEE
15 years 8 months ago
2007
IEEE
RFID technologies are gaining much attention as they are attractive solutions to many application domains. Localization based on active RFID technologies provides a much needed ad...