Sciweavers

54 search results - page 10 / 11
» Irregular Solutions of an Ill-Posed Problem
Sort
View
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
13 years 11 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
SCA
2007
13 years 10 months ago
Adaptive deformations with fast tight bounds
Simulation of deformations and collision detection are two highly intertwined problems that are often treated separately. This is especially true in existing elegant adaptive simu...
Miguel A. Otaduy, Daniel Germann, Stephane Redon, ...
CONEXT
2006
ACM
14 years 1 months ago
SMARTA: a self-managing architecture for thin access points
Optimally choosing operating parameters for access points in an enterprise wireless LAN environment is a difficult and well-studied problem. Unlike past work, the SMARTA self-man...
Nabeel Ahmed, Srinivasan Keshav
IJPP
2008
74views more  IJPP 2008»
13 years 7 months ago
Bandwidth Efficient All-to-All Broadcast on Switched Clusters
We develop an all-to-all broadcast scheme that achieves maximum bandwidth efficiency for clusters with tree topologies. Using our scheme for clusters with cut-through switches, an...
Ahmad Faraj, Pitch Patarasuk, Xin Yuan
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie