Sciweavers

2131 search results - page 107 / 427
» Immunity for Closed Sets
Sort
View
DASFAA
2011
IEEE
197views Database» more  DASFAA 2011»
14 years 10 months ago
Finding the Sites with Best Accessibilities to Amenities
Abstract. Finding the most accessible locations has a number of applications. For example, a user may want to find an accommodation that is close to different amenities such as s...
Qianlu Lin, Chuan Xiao, Muhammad Aamir Cheema, Wei...
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
16 years 6 months ago
BLOSOM: a framework for mining arbitrary boolean expressions
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishna...
KDD
2005
ACM
137views Data Mining» more  KDD 2005»
16 years 6 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
STOC
2006
ACM
114views Algorithms» more  STOC 2006»
16 years 6 months ago
Linear time low tree-width partitions and algorithmic consequences
Classes of graphs with bounded expansion have been introduced in [15], [12]. They generalize both proper minor closed classes and classes with bounded degree. For any class with b...
Jaroslav Nesetril, Patrice Ossona de Mendez
CVPR
2010
IEEE
16 years 2 months ago
On Growth and Formlets: Sparse Multi-Scale Coding of Planar Shape
This paper presents a sparse representation of 2D planar shape through the composition of warping functions, termed formlets, localized in scale and space. Each formlet subjects t...
Timothy Oleskiw, James Elder, Gabriel Peyr