Sciweavers

222 search results - page 7 / 45
» Tracking Information Flow in Dynamic Tree Structures
Sort
View
ICITA
2005
IEEE
14 years 1 months ago
Dynamic Markov Compression Using a Crossbar-Like Tree Initial Structure for Chinese Texts
This paper proposes the use of a crossbar-like tree structure to use with Dynamic Markov Compression (DMC) for the compression of Chinese text files. DMC had previously been found...
Ghim Hwee Ong, Jun-Ping Ng
ALPIT
2008
IEEE
14 years 2 months ago
Tree Kernel-Based Semantic Relation Extraction Using Unified Dynamic Relation Tree
This paper proposes a Unified Dynamic Relation Tree (DRT) span for tree kernel-based semantic relation extraction between entity names. The basic idea is to apply a variety of lin...
Longhua Qian, Guodong Zhou, Fang Kong, Qiaoming Zh...
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 4 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
CVPR
2003
IEEE
14 years 9 months ago
Using Multiple Cues for Hand Tracking and Model Refinement
We present a model based approach to the integration of multiple cues for tracking high degree of freedom articulated motions and model refinement. We then apply it to the problem...
Shan Lu, Dimitris N. Metaxas, Dimitris Samaras, Jo...
CIKM
2008
Springer
13 years 9 months ago
An extended cooperative transaction model for xml
In many application areas, for example in design or media production processes, several authors have to work cooperatively on the same project. Thereby, a frequently used data for...
Francis Gropengießer, Kai-Uwe Sattler