Sciweavers

1158 search results - page 188 / 232
» Approximation Algorithms for the Fixed-Topology Phylogenetic...
Sort
View
MOBIHOC
2009
ACM
16 years 6 months ago
Spectrum auction framework for access allocation in cognitive radio networks
Cognitive radio networks are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two categories of networks on different chann...
Gaurav S. Kasbekar, Saswati Sarkar
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 11 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
STACS
1999
Springer
15 years 10 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
MONET
2006
103views more  MONET 2006»
15 years 6 months ago
Minimum-Energy Broadcasting in Multi-hop Wireless Networks Using a Single Broadcast Tree
In this paper we address the minimum-energy broadcast problem in multi-hop wireless networks, so that all broadcast requests initiated by different source nodes take place on the s...
Ioannis Papadimitriou, Leonidas Georgiadis
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 25 days ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu