Sciweavers

554 search results - page 64 / 111
» Approximation algorithms and hardness results for labeled co...
Sort
View
ESA
2009
Springer
92views Algorithms» more  ESA 2009»
14 years 2 months ago
Minimizing Movement: Fixed-Parameter Tractability
Abstract. We study an extensive class of movement minimization problems which arise from many practical scenarios but so far have little theoretical study. In general, these proble...
Erik D. Demaine, MohammadTaghi Hajiaghayi, D&aacut...
MOBICOM
2006
ACM
14 years 1 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
CVPR
2005
IEEE
14 years 9 months ago
A Sparse Support Vector Machine Approach to Region-Based Image Categorization
Automatic image categorization using low-level features is a challenging research topic in computer vision. In this paper, we formulate the image categorization problem as a multi...
Jinbo Bi, Yixin Chen, James Ze Wang
FSTTCS
2003
Springer
14 years 27 days ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
14 years 8 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...