نتایج جستجو برای: temporal tree

تعداد نتایج: 409470  

2012
Oleksandr Kolomiyets Steven Bethard Marie-Francine Moens

We propose a new approach to characterizing the timeline of a text: temporal dependency structures, where all the events of a narrative are linked via partial ordering relations like BEFORE, AFTER, OVERLAP and IDENTITY. We annotate a corpus of children’s stories with temporal dependency trees, achieving agreement (Krippendorff’s Alpha) of 0.856 on the event words, 0.822 on the links between eve...

2009
Chunfeng Yuan Xi Li Weiming Hu Hanzi Wang

The bag-of-visual-words (BOVW) approaches are widely used in human action recognition. Usually, large vocabulary size of the BOVW is more discriminative for inter-class action classification while small one is more robust to noise and thus tolerant to the intra-class invariance. In this pape, we propose a pyramid vocabulary tree to model local spatio-temporal features, which can characterize th...

1997
John Z. Li Iqbal A. Goralwalla Duane Szafron

One of the key aspects of videos is the temporal relationship between video frames. In this paper we propose a tree-based model for specifying the temporal semantics of video data. We present a unique way of integrating our video model into an object database management system which has rich multimedia temporal operations. We further show how temporal histories are used to model video data, exp...

1997
John Z. Li Iqbal A. Goralwalla Duane Szafron

One of the key aspects of videos is the temporal relationship between video frames. In this paper we propose a tree-based model for specifying the temporal semantics of video data. We present a unique way of integrating our video model into an object database management system which has rich multimedia temporal operations. We further show how temporal histories are used to model video data, exp...

1993
Shinji Kono

We have developped Tokio interpreter[5] for rst order Inteval Temporal Logic[11] and an automatic theorem prover [6, 7] for Propositional Interval Temporal Logic. The veri er features deterministic tableau expansion and binary decision tree representation of subterms. Combining these, we can avoid repeated similar clausal form time constraints, and it is possible to execute wider range of speci...

1996
Mukesh Dalal Yong Feng

We present a new approach for determining consistency of temporal constraint networks based on Allen's interval-based framework All83]. The temporal network is rst translated into a clausal theory in propositional logic Men64], whose satissability is then determined using an anytime family of tractable rea-soners Dal96]. Anytime reasoners are complete reasoners that provide partial answers even...

2000
Donghui Zhang Alexander Markowetz Vassilis Tsotras Dimitrios Gunopulos Bernhard Seeger Christian S. Jensen Heidi Gregersen Dieter Pfoser Simonas Saltenis Janne Skyt Giedrius Slivinskas Kristian Torp Richard T. Snodgrass Fabio Grandi Thomas Myrach Kwang W. Nam Mario A. Nascimento John F. Roddick Keun H. Ryu

Any software made available via TimeCenter is provided \as is" and without any express or implied warranties, including, without limitation, the implied warranty of merchantability and tness for a particular purpose. The TimeCenter icon on the cover combines two \arrows." These \arrows" are letters in the so-called Rune alphabet used one millennium ago by the Vikings, as well as by their preced...

2000
Donghui Zhang Alexander Markowetz Vassilis Tsotras Dimitrios Gunopulos Bernhard Seeger Heidi Gregersen Dieter Pfoser Simonas Saltenis Janne Skyt Giedrius Slivinskas Kristian Torp Thomas Myrach Kwang W Nam Keun H Ryu

Any software made available via TimeCenter is provided \as is" and without any express or implied warranties, including, without limitation, the implied warranty of merchantability and tness for a particular purpose. The TimeCenter icon on the cover combines two \arrows." These \arrows" are letters in the so-called Rune alphabet used one millennium ago by the Vikings, as well as by their preced...

2002
Hirofumi KISHI Jun TANABE Hiroyuki KAWANO

In order to execute analytical queries in data warehouses, many researchers proposed various system architectures. We also develop spatial information systems for real time location services using PHS and GPS, we need OLAP (On-Line Analytical Processing) technologies in our traffic data warehouse. In order to deal with huge amount of data, many kinds of attributes, and a lot of dynamic queries,...

2012
S. S. Sane

These Association rule mining is to find association rules that satisfy the predefined minimum support and confidence from a given database. The Apriori and FP-tree algorithms are the most common and existing frequent itemsets mining algorithm, but these algorithms lack incremental learning ability. Incremental learning ability is desirable to solve the temporal dynamic property of knowledge an...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید