This paper provides a generalization of non-reducible descriptors by extending the concept of distance between patterns of di erent classes. Generalized non-reducible descriptors ...
Even though high-level hardware synthesis from dataflow graphs becomes popular in designing DSP systems, currently used dataflow models are inefficient to deal with emerging multi...
Users of complex applications need advice, assistance, and feedback while they work. We are experimenting with “adjunct” user agents that are aware of the history of interacti...
Robert G. Farrell, Peter G. Fairweather, Eric Brei...
Mashups are situational applications that build data flows to link the contents of multiple Web sources. Often times, ranking the results of a mashup is handled in a materializethe...
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...