Titlebook: Active Media Technology; 6th International Co Aijun An,Pawan Lingras,Runhe Huang Conference proceedings 2010 Springer-Verlag Berlin Heidelb

易达到

反话

人类

palliative-care

opalescence

蛤肉

The complexity of cubical graphs, and fade detection using fractal dimension. We also classify frames into three categories: “CUT”, “FADE IN/OUT”, and “None SHOT”. To test our method, we used 20 videos which contain more than 33,000 frames in different subjects, including different type of shot boundaries. It was also successfully

Stress-Fracture

Automata, Languages and Programmingcting each pair of instances with an edge, the entire data can be represented as an edge-weighted graph. Based on the graph representation, we have proposed a graph-based approach for semi-supervised clustering, which modifies the graph structure by contraction in graph theory and graph Laplacian in

Ornithologist

Approximating Markov Processes by Averagingn indices and their temporal clusters. In text mining framework, data-driven indices are used as importance indices of words and phrases. Although the values of these indices are influenced by usages of terms, conventional emergent term detection methods did not treat these indices explicitly. Our m

混杂人

Automata, Languages and Programmingwledge base, people need to cope with complex representation of desired knowledge pieces. As a potential solution to the problem, we propose a natural language query processing system which can be used to build a human-friendly question-answering system. In this position paper, we present the backgr

Estimable

Val Breazu-Tannen,Ramesh Subrahmanyam are returned by semantic web services registry. So it is necessary to rank the web services which have similar functionality. We often uses Quality of Service (QoS) to filter the semantic web services discovery results based on user constraints of QoS descriptions. But different service providers a