Sciweavers

180 search results - page 13 / 36
» Pruning the Search Space in Path-Based Test Generation
Sort
View
150
Voted
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
15 years 9 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
75
Voted
DAGSTUHL
2006
14 years 11 months ago
Efficient Software Model Checking of Data Structure Properties
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
Chandrasekhar Boyapati, Paul T. Darga
JDWM
2007
107views more  JDWM 2007»
14 years 9 months ago
Evolutionary Induction of Mixed Decision Trees
This article presents a new evolutionary algorithm (EA) for induction of mixed decision trees. In nonterminal nodes of a mixed tree, different types of tests can be placed, rangin...
Marek Kretowski, Marek Grzes
CVPR
2011
IEEE
14 years 1 months ago
Shape Based Pedestrian Parsing
We describe a simple model for parsing pedestrians based on shape. Our model assembles candidate parts from an oversegmentation of the image and matches them to a library of exemp...
Yihang Bo, Charless Fowlkes
81
Voted
CVPR
2005
IEEE
15 years 11 months ago
Shape Regularized Active Contour Using Iterative Global Search and Local Optimization
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
Tianli Yu, Jiebo Luo, Narendra Ahuja