Sciweavers

7289 search results - page 1314 / 1458
» A Dependent Set Theory
Sort
View
151
Voted
FOCS
2006
IEEE
15 years 12 months ago
Hardness of Learning Halfspaces with Noise
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
Venkatesan Guruswami, Prasad Raghavendra
136
Voted
GLVLSI
2006
IEEE
152views VLSI» more  GLVLSI 2006»
15 years 12 months ago
2 Gbps SerDes design based on IBM Cu-11 (130nm) standard cell technology
This paper introduces a standard cell based design for a Serializer and Deserializer (SerDes) communication link. The proposed design is area, power and design time efficient as c...
Rashed Zafar Bhatti, Monty Denneau, Jeff Draper
LICS
2006
IEEE
15 years 11 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
156
Voted
ANCS
2006
ACM
15 years 11 months ago
WormTerminator: an effective containment of unknown and polymorphic fast spreading worms
The fast spreading worm is becoming one of the most serious threats to today’s networked information systems. A fast spreading worm could infect hundreds of thousands of hosts w...
Songqing Chen, Xinyuan Wang, Lei Liu, Xinwen Zhang
203
Voted
MOBICOM
2006
ACM
15 years 11 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
« Prev « First page 1314 / 1458 Last » Next »