Sciweavers

4560 search results - page 80 / 912
» Finding Data in the Neighborhood
Sort
View
SCAM
2007
IEEE
14 years 2 months ago
Finding Inputs that Reach a Target Expression
We present an automated program analysis, called Reach, to compute program inputs that cause evaluation of explicitly-marked target expressions. Reach has a range of applications ...
Matthew Naylor, Colin Runciman
CINQ
2004
Springer
119views Database» more  CINQ 2004»
14 years 1 months ago
How to Quickly Find a Witness
The subfield of itemset mining is essentially a collection of algorithms. Whenever a new type of constraint is discovered, a specialized algorithm is proposed to handle it. All o...
Daniel Kifer, Johannes Gehrke, Cristian Bucila, Wa...
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
14 years 1 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...
ECCV
2010
Springer
14 years 29 days ago
Finding Semantic Structures in Image Hierarchies using Laplacian Graph Energy
Many segmentation algorithms describe images in terms of a hierarchy of regions. Although such hierarchies can produce state of the art segmentations and have many applications, th...
WABI
2001
Springer
112views Bioinformatics» more  WABI 2001»
14 years 10 days ago
Finding an Optimal Inversion Median: Experimental Results
We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree usi...
Adam C. Siepel, Bernard M. E. Moret