Sciweavers

604 search results - page 59 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
DAC
1999
ACM
15 years 2 months ago
Vex - A CAD Toolbox
The increasing size and complexity of designs is making the use of hardware description languages (HDLs), such as Verilog and VHDL, more prevalent. They are able to describe both ...
Jules P. Bergmann, Mark Horowitz
AES
2007
Springer
141views Cryptology» more  AES 2007»
14 years 10 months ago
Numerical methods for modelling leaching of pollutants in soils
Pesticides used in crop production and herbicides used for weed control are the major source of nonpoint-source pollutants to groundwater. The movement and degradation of pesticid...
M. Isabel Asensio, B. Ayuso, Luis Ferragut, G. San...
TMC
2010
152views more  TMC 2010»
14 years 8 months ago
On Multihop Distances in Wireless Sensor Networks with Random Node Locations
—Location and intersensor distance estimations are important functions for the operation of wireless sensor networks, especially when protocols can benefit from the distance info...
Serdar Vural, Eylem Ekici
BROADNETS
2006
IEEE
15 years 3 months ago
Minimum Rejection Scheduling in All-Photonic Networks
Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but the inability to per...
Nahid Saberi, Mark Coates
STOC
2006
ACM
132views Algorithms» more  STOC 2006»
15 years 10 months ago
Near-optimal algorithms for unique games
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
Moses Charikar, Konstantin Makarychev, Yury Makary...