Sciweavers

841 search results - page 54 / 169
» Approximability of Minimum AND-Circuits
Sort
View
TC
2008
13 years 10 months ago
Localized Broadcasting with Guaranteed Delivery and Bounded Transmission Redundancy
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
Majid Khabbazian, Vijay K. Bhargava
TSP
2008
69views more  TSP 2008»
13 years 10 months ago
Stochastic Stability Analysis for the Constant-Modulus Algorithm
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
Victor H. Nascimento, M. T. M. Silva
RCIS
2010
13 years 8 months ago
A Tree-based Approach for Efficiently Mining Approximate Frequent Itemsets
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
Jia-Ling Koh, Yi-Lang Tu
DEXA
2009
Springer
153views Database» more  DEXA 2009»
14 years 1 months ago
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System
Abstract. Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses ...
Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, ...
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
14 years 2 days ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov