5169 search results - page 430 / 1034 » Locality approximation using time |
219
click to vote
MONET
2006
15 years 7 months ago
2006
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...
242
click to vote
SWAT
2010
Springer
16 years 20 days ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...
200
click to vote
FOCS
2008
IEEE
16 years 2 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
248
click to vote
CMSB
2007
Springer
16 years 1 months ago
2007
Springer
We give a description of a Petri net-based framework for modelling and analysing biochemical pathways, which unifies the qualitative, stochastic and continuous paradigms. Each per...
190
click to vote
FOCS
1999
IEEE
15 years 12 months ago
1999
IEEE
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...