Sciweavers

301 search results - page 31 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
WWW
2005
ACM
14 years 9 months ago
Focused crawling by exploiting anchor text using decision tree
Focused crawlers are considered as a promising way to tackle the scalability problem of topic-oriented or personalized search engines. To design a focused crawler, the choice of s...
Jun Li, Kazutaka Furuse, Kazunori Yamaguchi
WIDM
2004
ACM
14 years 1 months ago
Ctree: a compact tree for indexing XML data
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
GIS
2009
ACM
14 years 9 months ago
Efficient Viewpoint Assignment for Urban Texture Documentation
We envision participatory texture documentation (PTD) as a process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobile phones parti...
Cyrus Shahabi, Farnoush Banaei Kashani, Houtan Shi...
SIGSOFT
2007
ACM
14 years 9 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
14 years 9 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...