Sciweavers

313 search results - page 2 / 63
» There is no ordering on the classes in the generalized high ...
Sort
View
CCR
2006
122views more  CCR 2006»
13 years 5 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
LOGCOM
2007
92views more  LOGCOM 2007»
13 years 5 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
NIPS
2008
13 years 6 months ago
Beyond Novelty Detection: Incongruent Events, when General and Specific Classifiers Disagree
Unexpected stimuli are a challenge to any machine learning algorithm. Here we identify distinct types of unexpected events, focusing on 'incongruent events' when 'g...
Daphna Weinshall, Hynek Hermansky, Alon Zweig, Jie...
ACSC
2000
IEEE
13 years 9 months ago
A Low-Cost High-Impact Computer Science Show for Family Audiences
Science shows are commonly presented for the general public, and especially children, at science centers and festivals. Usually they use attention-grabbing experiments from the ph...
Tim Bell
JMLR
2010
137views more  JMLR 2010»
13 years 3 days ago
HOP-MAP: Efficient Message Passing with High Order Potentials
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
Daniel Tarlow, Inmar Givoni, Richard S. Zemel