Sciweavers

3820 search results - page 385 / 764
» Bounded Model Debugging
Sort
View
MST
2011
200views Hardware» more  MST 2011»
14 years 11 months ago
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...
Antonio Fernández Anta, José Luis L&...
ICCV
1998
IEEE
16 years 6 months ago
Wormholes in Shape Space: Tracking Through Discontinuous Changes in Shape
Existing object tracking algorithms generally use some form of local optimisation, assuming that an object's position and shape change smoothly over time. In some situations ...
Tony Heap, David Hogg
ICML
2009
IEEE
16 years 5 months ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
ICML
2005
IEEE
16 years 5 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
16 years 4 months ago
On the limits of cache-obliviousness
In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possib...
Gerth Stølting Brodal, Rolf Fagerberg