Sciweavers

7015 search results - page 150 / 1403
» Approximation algorithms for co-clustering
Sort
View
SODA
2004
ACM
146views Algorithms» more  SODA 2004»
13 years 11 months ago
Approximating the two-level facility location problem via a quasi-greedy approach
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
Jiawei Zhang
CSE
2008
IEEE
13 years 11 months ago
Energy Efficient Broadcast in Distributed Ad Hoc Wireless Networks
In this work we present algorithms for Minimum Energy Consumption Broadcast Subgraph (MECBS) problem. First, we focus on designing distributed algorithms for MECBS. To our knowled...
Subhas Kumar Ghosh
ISCAS
2007
IEEE
371views Hardware» more  ISCAS 2007»
14 years 3 months ago
FIR Filter Approximation by IIR Filters Based on Discrete-Time Vector Fitting
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
Ngai Wong, Chi-Un Lei
ICDT
2005
ACM
149views Database» more  ICDT 2005»
14 years 3 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
ICCSA
2004
Springer
14 years 3 months ago
Packing: Scheduling, Embedding, and Approximating Metrics
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
Hu Zhang