Sciweavers

721 search results - page 60 / 145
» On Generators of Random Quasigroup Problems
Sort
View
FOCS
1998
IEEE
14 years 9 days ago
Parametric and Kinetic Minimum Spanning Trees
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
Pankaj K. Agarwal, David Eppstein, Leonidas J. Gui...
CORR
2007
Springer
119views Education» more  CORR 2007»
13 years 8 months ago
Distributed Source Coding in the Presence of Byzantine Sensors
—The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack; that is, an unknown group of sensors have been reprogrammed by a m...
Oliver Kosut, Lang Tong
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 8 months ago
Dense Error Correction for Low-Rank Matrices via Principal Component Pursuit
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
Arvind Ganesh, John Wright, Xiaodong Li, Emmanuel ...
JSAC
2011
116views more  JSAC 2011»
13 years 3 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
14 years 14 days ago
A Communication Scheduling Algorithm for Multi-FPGA Systems
For multiple FPGA systems, the limited number of I/O pins causes many problems. To solve these problems, efficient communication scheduling among FPGAs is crucial for obtaining hi...
Jinwoo Suh, Dong-In Kang, Stephen P. Crago