Sciweavers

1312 search results - page 125 / 263
» Formally Optimal Boxing
Sort
View
RSA
2010
94views more  RSA 2010»
13 years 7 months ago
Word maps and spectra of random graph lifts
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
Nati Linial, Doron Puder
COLT
2000
Springer
14 years 1 months ago
On the Learnability and Design of Output Codes for Multiclass Problems
Output coding is a general framework for solving multiclass categorization problems. Previous research on output codes has focused on building multiclass machines given predefine...
Koby Crammer, Yoram Singer
ICFP
1999
ACM
14 years 1 months ago
Representing Java Classes in a Typed Intermediate Language
We propose a conservative extension of the polymorphic lambda calculus (A5B ) as an intermediate language for compiling languages with name-based class and interface hierarchies. ...
Christopher League, Zhong Shao, Valery Trifonov
FPL
2006
Springer
113views Hardware» more  FPL 2006»
14 years 29 days ago
A Novel Heuristic and Provable Bounds for Reconfigurable Architecture Design
This paper is concerned with the application of formal optimisation methods to the design of mixed-granularity FPGAs. In particular, we investigate the appropriate mix and floorpl...
Alastair M. Smith, George A. Constantinides, Peter...
TIT
1998
127views more  TIT 1998»
13 years 9 months ago
On a New Class of Codes for Identifying Vertices in Graphs
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
Mark G. Karpovsky, Krishnendu Chakrabarty, Lev B. ...