Sciweavers

2957 search results - page 304 / 592
» The Complexity of Polynomial-Time Approximation
Sort
View
202
Voted
TSP
2010
15 years 1 months ago
Randomized and distributed self-configuration of wireless networks: two-layer Markov random fields and near-optimality
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Sung-eok Jeon, Chuanyi Ji
ICIP
2001
IEEE
16 years 8 months ago
Algorithmic modifications to SPIHT
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
Ulug Bayazit, William A. Pearlman
DIS
2009
Springer
16 years 1 months ago
A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
Fabio Fumarola, Anna Ciampi, Annalisa Appice, Dona...
FOCS
2006
IEEE
16 years 21 days ago
Heat Flow and a Faster Algorithm to Compute the Surface Area of a Convex Body
We draw on the observation that the amount of heat diffusing outside of a heated body in a short period of time is proportional to its surface area, to design a simple algorithm f...
Mikhail Belkin, Hariharan Narayanan, Partha Niyogi
ACRI
2004
Springer
16 years 1 days ago
Chaos in a Simple Cellular Automaton Model of a Uniform Society
In this work we study the collective behavior in a model of a simplified homogeneous society. Each agent is modeled as a binary “perceptron”, receiving neighbors’ opinions a...
Franco Bagnoli, Fabio Franci, Raúl Rechtman