Sciweavers

438 search results - page 48 / 88
» A (1-1 e)-approximation algorithm for the generalized assign...
Sort
View
FOCS
1997
IEEE
15 years 7 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
144
Voted
DAM
2008
109views more  DAM 2008»
15 years 3 months ago
Minimal comparability completions of arbitrary graphs
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
Pinar Heggernes, Federico Mancini, Charis Papadopo...
162
Voted
COMPGEOM
2004
ACM
15 years 8 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
CIKM
2009
Springer
15 years 10 months ago
Compressing tags to find interesting media groups
On photo sharing websites like Flickr and Zooomr, users are offered the possibility to assign tags to their uploaded pictures. Using these tags to find interesting groups of sem...
Matthijs van Leeuwen, Francesco Bonchi, Börku...
142
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
Load Balancing in Large-Scale RFID Systems
A radio frequency identifier (RFID) system consists of inexpensive, uniquely identifiable tags that are mounted on physical objects, and readers that track these tags (and hence...
Qunfeng Dong, Ashutosh Shukla, Vivek Shrivastava, ...