#### Filter Results:

- Full text PDF available (52)

#### Publication Year

2002

2017

- This year (8)
- Last 5 years (38)
- Last 10 years (60)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Antonios Antoniadis, Chien-Chung Huang
- SWAT
- 2012

We consider the following variant of the speed scaling problem introduced by Yao, Demers, and Shenker. We are given a set of jobs and we have a variable-speed processor to process them. The higher the processor speed, the higher the energy consumption. Each job is associated with its own release time, deadline, and processing volume. The objective is to… (More)

Many Web information services utilize techniques of information extraction(IE) to collect important facts from the Web. To create more advanced services, one possible method is to discover thematic information from the collected facts through text classification. However, most conventional text classification techniques rely on manual-labelled corpora and… (More)

- Chien-Chung Huang, Telikepalli Kavitha
- ICALP
- 2011

- Chien-Chung Huang
- SODA
- 2010

We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applicants. Both institutes and applicants have preferences over the other side. An institute classifies the applicants based on their research areas (or any other criterion), and, for… (More)

- Chien-Chung Huang, Zoya Svitkina
- Algorithmica
- 2009

We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theoretic problem. Given a set of agents and a set of centers, where agents have preferences over centers and centers have capacities, the goal is to open a subset of centers and to… (More)

- Chien-Chung Huang
- ESA
- 2006

This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for every cheating man to get a better partner than the one he gets if everyone is truthful. We study how to circumvent this theorem and incite men to cheat. First we devise coalitions in which… (More)

- Po-Chi Soo, Yu-Tze Horng, +7 authors Hsin-Chih Lai
- Journal of microbiological methods
- 2006

The Mycobacterium tuberculosis (MTB) shows different virulence and host infection range from other members of the M. tuberculosis complex (MTBC). Differential identification of MTB from MTBC is thus important in certain occasions. The currently commercially available molecular assays which use either IS6110 or 16S rDNA fragment as identification targets are… (More)

- Umang Bhaskar, Lisa Fleischer, Darrell Hoy, Chien-Chung Huang
- SODA
- 2009

In routing games with infinitesimal players, it follows from well-known convexity arguments that equilibria exist and are unique (up to induced delays, and under weak assumptions on delay functions). In routing games with players that control large amounts of flow, uniqueness has been demonstrated only in limited cases: in 2-terminal, nearly-parallel… (More)

We introduce a bidding language for expressing negative value externalities in position auctions for online advertising. The unit-bidder constraints (UBC) language allows a bidder to condition a bid on its allocated slot and on the slots allocated to other bidders. We introduce a natural extension of the Generalized Second Price (GSP) auction, the… (More)

- Fidaa Abed, Chien-Chung Huang
- ESA
- 2012

We investigate coordination mechanisms that schedule n jobs on m unrelated machines. The objective is to minimize the latest completion of all jobs, i.e., the makespan. It is known that if the mechanism is non-preemptive, the price of anarchy is Ω(logm). Both Azar, Jain, and Mirrokni (SODA 2008) and Caragiannis (SODA 2009) raised the question whether it is… (More)