Sciweavers

10412 search results - page 1502 / 2083
» The efficiency of algorithms - misconceptions
Sort
View
STOC
2009
ACM
91views Algorithms» more  STOC 2009»
16 years 7 months ago
Inaccessible entropy
We put forth a new computational notion of entropy, which measures the (in)feasibility of sampling high entropy strings that are consistent with a given protocol. Specifically, we...
Iftach Haitner, Omer Reingold, Salil P. Vadhan, Ho...
ESORICS
2009
Springer
16 years 7 months ago
Data Structures with Unpredictable Timing
Abstract. A range of attacks on network components, such as algorithmic denial-of-service attacks and cryptanalysis via timing attacks, are enabled by data structures for which an ...
Darrell Bethea, Michael K. Reiter
COORDINATION
2009
Springer
16 years 7 months ago
Multicore Scheduling for Lightweight Communicating Processes
Process-oriented programming is a design methodology in which software applications are constructed from communicating concurrent processes. A process-oriented design is typically ...
Carl G. Ritson, Adam T. Sampson, Fred R. M. Barnes
KDD
2008
ACM
182views Data Mining» more  KDD 2008»
16 years 7 months ago
Classification with partial labels
In this paper, we address the problem of learning when some cases are fully labeled while other cases are only partially labeled, in the form of partial labels. Partial labels are...
Nam Nguyen, Rich Caruana
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
16 years 7 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
« Prev « First page 1502 / 2083 Last » Next »