Computer Science Project ideas

[appu06103010]

DATA MINING BASED PROJECTS

=>Building a Multiple-Criteria Negotiation Support System
=>An Exploratory Study of Database Integration Processes
=>COFI approach for Mining Frequent Item sets
=>Online Random Shuffling of Large Database Tables
=>A Flexible Content Adaptation System Using a Rule-Based Approach
=>Efficient Revalidation of XML Documents
=>Practical Algorithms and Lower Bounds for Similarity Search in Massive Graphs
=>Enhancing the Effectiveness of Clustering with Spectra Analysis
=>Efficient Monitoring Algorithm for Fast News Alerts
=>Top-k Monitoring in Wireless Sensor Networks
=>Frequent Closed Sequence Mining without Candidate Maintenance
=>Maintaining Strong Cache Consistency for the Domain Name System
=>Efficient Skyline and Top-k Retrieval in Subspaces
=>Efficient Process of Top-k Range-Sum Queries over Multiple Streams with Minimized Global Error
=>Fast Nearest Neighbor Condensation for Large Data Sets Classification
=>Wildcard Search in Structured Peer-to-Peer Networks
=>Neural-Based Learning Classifier Systems
=>Discovering Frequent Agreement Sub trees from Phylogenetic Data
=>Watermarking Relational Databases Using Optimization-Based Techniques
=>Extracting Actionable Knowledge from Decision Trees
=>A Requirements Driven Framework for Benchmarking Semantic Web Knowledge Base Systems
=>The Threshold Algorithm: From Middleware Systems to the Relational Engine
=>Rank Aggregation for Automatic Schema Matching
=>Rule Extraction from Support Vector Machines: A Sequential Covering Approach
=>Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions
=>A Note on Linear Time Algorithms for Maximum Error Histograms
=>Toward Exploratory Test-Instance-Centered Diagnosis in High-Dimensional Classification
=>An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
=>A Method for Estimating the Precision of Place name Matching
=>Efficiently Querying Large XML Data Repositories: A Survey
=>Graph-Based Analysis of Human Transfer Learning Using a Game Tested
=>Evaluating Universal Quantification in XML
=>Customer Profiling & Segmentation using Data Mining Techniques
=>Efficient Frequent Item set Mining Using Global Profit Weighted (GPW) Support Threshold
=>Fast Algorithms for Frequent Item set Mining using FP-Trees
=>Mining Confident Rules without Support Requirement
=>Mining Frequent Item set without Support Threshold
=>unified framework for utility based measures
=>An Adaptation of the Vector-Space Model for Ontology-Based Information Retrieval
=>The Google Similarity Distance
=>Reverse Nearest Neighbors Search in Ad Hoc Subspaces
=>Quality-Aware Sampling and Its Applications in Incremental Data Mining
=>An Exact Data Mining Method for Finding Center Strings and All Their Instances
=>Negative Samples Analysis in Relevance Feedback
=>Bayesian Networks for Knowledge-Based Authentication
=>Continuous Nearest Neighbor Queries over Sliding Windows
=>The Concentration of Fractional Distances
=>Efficient Approximate Query Processing in Peer-to-Peer Networks
=>Ontology-Based Service Representation and Selection
=>Compressed Hierarchical Mining of Frequent Closed Patterns from Dense Data Sets
=>Semi-supervised Regression with Co-training-Style Algorithms
=>Evaluation of Clustering with Banking Credit Card segment
=>An efficient clustering algorithm for huge dimensional database
=>Novel approach for Targeted Association Querying
=>Hiding Sensitive Association Rules with Limited Side Effects
=>A Relation-Based Search Engine in Semantic Web
=>Classifier Ensembles with a Random Linear Oracle
=>An Efficient Web Page Change Detection System Based on an Optimized Hungarian Algorithm
=>Mining Nonambiguous Temporal Patterns for Interval-Based Events
=>Peer-to-Peer in Metric Space and Semantic Space
=>Adaptive Index Utilization in Memory-Resident Structural Joins
=>On Three Types of Covering-Based Rough Sets
=>Discovering Frequent Generalized Episodes When Events Persist for Different Durations
=>Efficient and Scalable Algorithms for Inferring Likely Invariants in Distributed Systems
=>Mining Closed Frequent item set using CHARM algorithm
=>Integrating Constraints and Metric Learning in Semi-Supervised Clustering
=>Foundational Approach to Mining Item set Utilities from Databases
=>Fast Frequent Pattern Mining
=>Evaluation for Mining Share Frequent item sets Containing Infrequent Subsets

[pravinkurhade]

MOBILE PHONE BASED PROJECTS

=>An Efficient Packet Scheduling Algorithm With Deadline Guarantees for Input-Queued Switches
=>Scalability of Wireless Networks
=>Class Bench: A Packet Classification Benchmark
=>Fairness and Load Balancing in Wireless LANs Using Association Control
=>Reliable Multi-path Provisioning for High-Capacity Backbone Mesh Networks
=>Limitations of Equation-Based Congestion Control
=>Performance Improvement of Two-Dimensional Packet Classification by Filter Rephrasing
=>A Queuing-Theoretic Foundation of Available Bandwidth Estimation: Single-Hop Analysis
=>Waveband Switching for Dynamic Traffic Demands in Multi-granular Optical Networks
=>Distribution of Path Durations in Mobile Ad Hoc Networks and Path Selection
=>Distributed Optimal Self-Organization in Ad Hoc Wireless Sensor Networks
=>A Unified Framework for Max-Min and Min-Max Fairness With Applications
=>On Shortest Path Representation
=>A Network Calculus With Effective Bandwidth
=>A Framework for Evaluating the Performance of Cluster Algorithms for Hierarchical Networks
=>Distributed Algorithms for Secure Multi-path Routing in Attack-Resistant Networks
=>Optimal Scheduling and Routing for Maximum Network Throughput
=>Two Techniques for Fast Computation of Constrained Shortest Paths
=>Improved Quasi-Path Restoration in Mesh Networks
=>A Geometric Approach to Improving Active Packet Loss Measurement
=>A Scalable Call Admission Control Algorithm
=>Efficient Broadcasting Using Network Coding
=>Statistical Techniques for Detecting Traffic Anomalies Through Packet Header Data
=>A Model-Based Approach to Evaluation of the Efficacy of FEC Coding in Combating Network Packet Losses
=>Faster Algorithms for Construction of Recovery Trees Enhancing QoP and QoS
=>A Wavelet-Based Approach to Detect Shared Congestion
=>Optimal Communication Complexity of Generic Multicast Key Distribution
=>Reliable Routings in Networks With Generalized Link Failure Events
=>Optimal and Distributed Protocols for Cross-Layer Design of Physical and Transport Layers in MANETs
=>Traffic Modeling and Proportional Partial Caching for Peer-to-Peer Systems
=>On Static and Dynamic Partitioning Behavior of Large-Scale P2P Networks
=>Scalability of Network-Failure Resilience: Analysis Using Multi-Layer Probabilistic Graphical Models
=>Maintaining Colored Trees for Disjoint Multi-path Routing Under Node Failures
=>High-Performance Self-Routing Algorithm for Multiprocessor Systems with Shuffle Interconnections
=>Optical Switching Networks with Minimum number of Limited Range Wavelength Converters
=>Waveband Switching for Dynamic Traffic Demands in Multi-granular Optical Networks
=>Network implementation through port numbers

[ashokjp]

IMAGE PROCESSING BASED PROJECTS

=>An Efficient Phase and Object Estimation Scheme for Phase-Diversity Time Series Data
=>A Recursive Model-Reduction Method for Approximate Inference in Gaussian Markov Random Fields
=>LCD Motion Blur Reduction: A Signal Processing Approach
=>A Lossless Compression Scheme for Bayer Color Filter Array Images
=>Optimal Sensor Array Configuration in Remote Image Formation
=>Image Classification Using Correlation Tensor Analysis
=>Orthogonal Rotation-Invariant Moments for Digital Image Processing
=>Generalized Flooding and Multicue PDE-Based Image Segmentation
=>Maximum Likelihood Wavelet Density Estimation With Applications to Image and Shape Matching
=>Weighted Adaptive Lifting-Based Wavelet Transform for Image Coding
=>A Run-Based Two-Scan Labeling Algorithm
=>Using Spanning Graphs for Efficient Image Registration
=>Continuous Sampling in Mutual-Information Registration
=>Universal Impulse Noise Filter Based on Genetic Programming
=>Active Learning Methods for Interactive Image Retrieval
=>Analysis and Compensation of Rolling Shutter Effect
=>Automatic Active Model Initialization via Poisson Inverse Gradient
=>FIR Filter Banks for Hexagonal Data Processing
=>Wavelet Feature Selection for Image Classification
=>Robust Control-Based Object Tracking
=>Binary Partition Trees for Object Detection
=>A Sparsity-Enforcing Method for Learning Face Features
=>A Fast Multilevel Algorithm for Wavelet-Regularized Image Restoration
=>Mode-kn Factor Analysis for Image Ensembles
=>Preferential Image Segmentation Using Trees of Shapes
=>A Shearlet Approach to Edge Analysis and Detection
=>Study on Huber Fractal Image Compression
=>Spherical Coding Algorithm for Wavelet Image Compression
=>Multiple Description Coding With Prediction Compensation
=>Signal and Image Approximation Using Interval Wavelet Transform
=>Face Verification With Balanced Thresholds
=>Optimal Signature Design for Spread-Spectrum Steganography

[vinny312]

pls send information about efficient revalidation of xml documents