18306 search results - page 154 / 3662 » Algorithmics in Exponential Time |
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
PCI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The advances in wireless communications along with the exponential growth of transistors per integrated circuit lead to a rapid evolution of Wireless Sensor Devices (WSDs...
ICDCS
2003
IEEE
15 years 3 months ago
2003
IEEE
Writing correct distributed programs is hard. In spite of extensive testing and debugging, software faults persist even in commercial grade software. Many distributed systems, esp...
KDD
1998
ACM
15 years 2 months ago
1998
ACM
Wepresent a novel, fast methodfor associationminingill high-dimensionaldatasets. OurCoincidence Detection method, which combines random sampling and Chernoff-Hoeffding bounds with...
102
Voted
DATE
2004
IEEE
15 years 1 months ago
2004
IEEE
For successful SoC design, efficient and scalable communication architecture is crucial. Some bus interconnects now provide configurable structures to meet this requirement of an ...