Sciweavers

1047 search results - page 117 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
IJCAI
1989
13 years 9 months ago
Program Derivation Using Analogy
We present a methodology for using analogy to derive programs based on a derivational transformation method. The derived programs are deductively closed under the rules in the kno...
Mehdi T. Harandi, Sanjay Bhansali
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
14 years 8 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 8 months ago
Fast Data Anonymization with Low Information Loss
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
Gabriel Ghinita, Panagiotis Karras, Panos Kalnis, ...
IFIP
2004
Springer
14 years 1 months ago
Multipath Power Sensitive Routing Protocol for Mobile Ad Hoc Networks
: Mobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure, and frequent host mobility. A plethora of routing protocols has been proposed. A...
Anand Prabhu Subramanian, A. J. Anto, Janani Vasud...
BMCBI
2004
156views more  BMCBI 2004»
13 years 7 months ago
DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors
Background: Parallel computing is frequently used to speed up computationally expensive tasks in Bioinformatics. Results: Herein, a parallel version of the multi-alignment program...
Martin Schmollinger, Kay Nieselt, Michael Kaufmann...