Home / EG Comp Lab / JAVA

JAVA

Ranking Spatial Data by Quality Preferences

Abstract: A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, using a real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities …

Read More »

Mining Association Rules with Item Constraints

Abstract This paper presents the IMine index, a general and compact structure which provides tight integration of item set extraction in a relational DBMS. Since no constraint is enforced during the index creation phase, IMine provides a complete representation of the original database. To reduce the I/O cost, data accessed …

Read More »

Facilitating Document Annotation Using Content and Querying Value

Facilitating Document Annotation using Content and Querying Value ABSTRACT: A large number of organizations today generate and share textual descriptions of their products, services, and actions. Such collections of textual data contain significant amount of structured information, which remains buried in the unstructured text. While information extraction algorithms facilitate the …

Read More »

Game-Theoretic Pricing for Video Streaming in Mobile Networks

ABSTRACT Mobile phones are among the most popular consumer devices, and the recent developments of 3G networks and smart phones enable users to watch video programs by subscribing data plans from service providers. Due to the ubiquity of mobile phones and phone-to-phone communication technologies, data-plan subscribers can redistribute the video …

Read More »

Boundary Cutting for Packet Classification

Boundary Cutting for Packet Classification ABSTRACT: Decision-tree-based packet classification algorithms such as HiCuts, HyperCuts, and EffiCuts show excellent search performance by exploiting the geometrical representation of rules in a classifier and searching for a geometric subspace to which each input packet belongs. However, decision tree algorithms involve complicated heuristics for …

Read More »

Data Leakage Detection(2011)

INTRODUCTION In the course of doing business, sometimes sensitive data must be handed over to supposedly trusted third parties. For example, a hospital may give patient records to researchers who will devise new treatments. Similarly, a company may have partnerships with other companies that require sharing customer data. Another enterprise …

Read More »

Optimal Bandwidth Assignment for Multiple-Description-Coded Video

Optimal Bandwidth Assignment for Multiple-Description-Coded Video Abstract: In video streaming over multicast network, user bandwidth requirement is often heterogeneous possibly with orders of magnitude difference (say, from hundreds of kb/s for mobile devices to tens of Mb/s for high-definition TV). Multiple description coding (MDC) can be used to address this …

Read More »

Keyword Query Routing

ABSTRACT: Keyword search is an intuitive paradigm for searching linked data sources on the web. We propose to route keywords only to relevant sources to reduce the high cost of processing keyword search queries over all sources. We propose a novel method for computing top-k routing plans based on their …

Read More »