Sciweavers

1047 search results - page 142 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
KDD
2009
ACM
163views Data Mining» more  KDD 2009»
14 years 8 months ago
Large-scale graph mining using backbone refinement classes
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
Andreas Maunz, Christoph Helma, Stefan Kramer
CIKM
2006
Springer
13 years 11 months ago
Structure-based querying of proteins using wavelets
The ability to retrieve molecules based on structural similarity has use in many applications, from disease diagnosis and treatment to drug discovery and design. In this paper, we...
Keith Marsolo, Srinivasan Parthasarathy, Kotagiri ...
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
TWC
2008
143views more  TWC 2008»
13 years 8 months ago
Mobile Privacy in Wireless Networks-Revisited
Abstract-- With the widespread use of mobile devices, the privacy of mobile location information becomes an important issue. In this paper, we present the requirements on protectin...
Caimu Tang, Dapeng Oliver Wu
AICCSA
2008
IEEE
216views Hardware» more  AICCSA 2008»
13 years 8 months ago
Mining fault tolerant frequent patterns using pattern growth approach
Mining fault tolerant (FT) frequent patterns from transactional datasets are very complex than mining all frequent patterns (itemsets), in terms of both search space exploration a...
Shariq Bashir, Zahid Halim, Abdul Rauf Baig