Sciweavers

721 search results - page 118 / 145
» Almost universal graphs
Sort
View
ICALP
2010
Springer
14 years 2 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
COLT
2001
Springer
14 years 2 months ago
Limitations of Learning via Embeddings in Euclidean Half-Spaces
The notion of embedding a class of dichotomies in a class of linear half spaces is central to the support vector machines paradigm. We examine the question of determining the mini...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon
ECOOP
1999
Springer
14 years 2 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Improving XOR-Dominated Circuits by Exploiting Dependencies between Operands
Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer ...
Ajay K. Verma, Paolo Ienne
CHES
2004
Springer
216views Cryptology» more  CHES 2004»
14 years 1 months ago
Efficient Countermeasures against RPA, DPA, and SPA
In the execution on a smart card, side channel attacks such as simple power analysis (SPA) and the differential power analysis (DPA) have become serious threat [15]. Side channel a...
Hideyo Mamiya, Atsuko Miyaji, Hiroaki Morimoto