Sciweavers

383 search results - page 72 / 77
» A new infeasible interior-point algorithm for linear program...
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
On Allocating Goods to Maximize Fairness
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
Deeparnab Chakrabarty, Julia Chuzhoy, Sanjeev Khan...
WWW
2005
ACM
14 years 8 months ago
Topic segmentation of message hierarchies for indexing and navigation support
Message hierarchies in web discussion boards grow with new postings. Threads of messages evolve as new postings focus within or diverge from the original themes of the threads. Th...
Jong Wook Kim, K. Selçuk Candan, Mehmet Emi...
ICALP
2004
Springer
14 years 26 days ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella
ANOR
2005
160views more  ANOR 2005»
13 years 7 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
VLSISP
2002
112views more  VLSISP 2002»
13 years 7 months ago
Minimizing Buffer Requirements under Rate-Optimal Schedule in Regular Dataflow Networks
Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dat...
Ramaswamy Govindarajan, Guang R. Gao, Palash Desai