Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #101 to #150.

On Coordination Among Multiple Auctions: Label: en
On the Approximation and Smoothed Complexity of Leontief Market Equilibria: Label: en
A Novel Biology-Based Reversible Data Hiding Fusion Scheme: Label: en
New Algorithms for the Spaced Seeds: Label: en
Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation: Label: en
A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays: Label: en
Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications: Label: en
Recognizing d-Interval Graphs and d-Track Interval Graphs: Label: en
On Tractable Exponential Sums: Label: en
A Hybrid Graph Representation for Recursive Backtracking Algorithms: Label: en
Solving General Lattice Puzzles: Label: en
Constant Time Generation of Biconnected Rooted Plane Graphs: Label: en
Improved Sublinear Time Algorithm for Width-Bounded Separators: Label: en
An $\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})$ Space Lower Bound for Finding ε-Approximate Quantiles in a Data Stream: Label: en
Approximation Schemes for Scheduling with Availability Constraints: Label: en
Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy: Label: en
Minimum Common String Partition Revisited: Label: en
Top-d Rank Aggregation in Web Meta-search Engine: Label: en
Truthful Auction for CPU Time Slots: Label: en
Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets: Label: en
Progress on Certifying Algorithms: Label: en
New Algorithms for Barrier Coverage with Mobile Sensors: Label: en
Adaptive Algorithms for Planar Convex Hull Problems: Label: en
Optimum Sweeps of Simple Polygons with Two Guards: Label: en
Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares: Label: en
Computing Minimum Diameter Color-Spanning Sets: Label: en
Minimum Cost Edge-Colorings of Trees Can Be Reduced to Matchings: Label: en
Path Separability of Graphs: Label: en
O((logn)2) Time Online Approximation Schemes for Bin Packing and Subset Sum Problems: Label: en
Online Algorithms for the Newsvendor Problem with and without Censored Demands: Label: en
Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks: Label: en
FPTAS’s for Some Cut Problems in Weighted Trees: Label: en
A Polynomial Time Approximation Scheme for Embedding Hypergraph in a Weighted Cycle: Label: en
Approximation Algorithms for the Capacitated Domination Problem: Label: en
Categorial Semantics of a Solution to Distributed Dining Philosophers Problem: Label: en
An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine: Label: en
A Supervised Feature Extraction Algorithm for Multi-class: Label: en
A Scalable Algorithm for Graph-Based Active Learning: Label: en
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach: Label: en
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants: Label: en
Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback: Label: en
Constraint Abstraction in Verification of Security Protocols: Label: en
Visiting a Polygon on the Optimal Way to a Query Point: Label: en
Optimal Surface Flattening: Label: en
A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks: Label: en
The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs: Label: en
Mixed Search Number of Permutation Graphs: Label: en
Ranking of Closeness Centrality for Large-Scale Social Networks: Label: en
Searching Trees with Sources and Targets: Label: en
Matching for Graphs of Bounded Degree: Label: en