Sciweavers

1236 search results - page 27 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
JMLR
2010
135views more  JMLR 2010»
14 years 4 months ago
Structured Prediction Cascades
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference i...
David Weiss, Benjamin Taskar
PPOPP
2009
ACM
15 years 10 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
CSFW
2008
IEEE
15 years 4 months ago
Joint State Theorems for Public-Key Encryption and Digital Signature Functionalities with Local Computation
Composition theorems in simulation-based approaches allow to build complex protocols from sub-protocols in a modular way. However, as first pointed out and studied by Canetti and ...
Ralf Küsters, Max Tuengerthal
DEBS
2008
ACM
14 years 11 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
SIGGRAPH
1991
ACM
15 years 1 months ago
Artificial evolution for computer graphics
CT This paper describes how evolutionary techniques of variation and selection can be used to create complex simulated structures, textures, and motions for use in computer graphic...
Karl Sims