Sciweavers

1154 search results - page 34 / 231
» On the editing distance of graphs
Sort
View
MM
2005
ACM
139views Multimedia» more  MM 2005»
14 years 2 months ago
Exploiting self-adaptive posture-based focus estimation for lecture video editing
Head pose plays a special role in estimating a presenter’s focuses and actions for lecture video editing. This paper presents an efficient and robust head pose estimation algori...
Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
ECAI
2000
Springer
14 years 1 months ago
Data Set Editing by Ordered Projection
In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) h...
Jesús S. Aguilar-Ruiz, José Crist&oa...
VLDB
2005
ACM
104views Database» more  VLDB 2005»
14 years 2 months ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
Nikolaus Augsten, Michael H. Böhlen, Johann G...
DAM
2008
145views more  DAM 2008»
13 years 8 months ago
Unicyclic and bicyclic graphs having minimum degree distance
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
Alexandru Ioan Tomescu
HCI
2011
13 years 5 days ago
Discovering Context: Classifying Tweets through a Semantic Transform Based on Wikipedia
By mapping messages into a large context, we can compute the distances between them, and then classify them. We test this conjecture on Twitter messages: Messages are mapped onto t...
Yegin Genc, Yasuaki Sakamoto, Jeffrey V. Nickerson