Sciweavers

1887 search results - page 40 / 378
» An efficient search algorithm for partially ordered sets
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Efficient human pose estimation via parsing a tree structure based human model
Human pose estimation is the task of determining the states (location, orientation and scale) of each body part. It is important for many vision understanding applications, e.g. v...
Xiaoqin Zhang, Changcheng Li, Xiaofeng Tong, Weimi...
CP
2007
Springer
14 years 1 months ago
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
Christophe Lecoutre, Lakhdar Sais, Sébastie...
SIGIR
2010
ACM
13 years 2 months ago
Efficient partial-duplicate detection based on sequence matching
With the ever-increasing growth of the Internet, numerous copies of documents become serious problem for search engine, opinion mining and many other web applications. Since parti...
Qi Zhang, Yue Zhang, Haomin Yu, Xuanjing Huang
DASFAA
2010
IEEE
220views Database» more  DASFAA 2010»
13 years 5 months ago
An Effective Object-Level XML Keyword Search
Keyword search is widely recognized as a convenient way to retrieve information from XML data. In order to precisely meet users' search concerns, we study how to effectively r...
Zhifeng Bao, Jiaheng Lu, Tok Wang Ling, Liang Xu, ...
AWPN
2008
232views Algorithms» more  AWPN 2008»
13 years 9 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser