Sciweavers

2766 search results - page 166 / 554
» Algorithms for trigonometric polynomials
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
Sequential Monte Carlo method for parameter estimation in diffusion models of affinity-based biosensors
Estimation of the amounts of target molecules in realtime affinity-based biosensors is studied. The problem is mapped to inferring the parameters of a temporally sampled diffusio...
Manohar Shamaiah, Xiaohu Shen, Haris Vikalo
COCO
2005
Springer
153views Algorithms» more  COCO 2005»
15 years 10 months ago
Average-Case Computations - Comparing AvgP, HP, and Nearly-P
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
Arfst Nickelsen, Birgit Schelm
126
Voted
FOCS
1994
IEEE
15 years 8 months ago
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
Michael A. Bender, Donna K. Slonim
ALGORITHMICA
2004
130views more  ALGORITHMICA 2004»
15 years 4 months ago
The Power of Priority Algorithms for Facility Location and Set Cover
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
Spyros Angelopoulos, Allan Borodin
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Fast k-Means Algorithms with Constant Approximation
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran