Sciweavers

1968 search results - page 388 / 394
» The Complexity of Valued Constraint Models
Sort
View
CVPR
2012
IEEE
11 years 9 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
WWW
2005
ACM
14 years 8 months ago
Expressiveness of XSDs: from practice to theory, there and back again
On an abstract level, XML Schema increases the limited expressive power of Document Type Definitions (DTDs) by extending them with a recursive typing mechanism. However, an invest...
Geert Jan Bex, Wim Martens, Frank Neven, Thomas Sc...
LCTRTS
2010
Springer
14 years 2 months ago
Sampling-based program execution monitoring
For its high overall cost during product development, program debugging is an important aspect of system development. Debugging is a hard and complex activity, especially in time-...
Sebastian Fischmeister, Yanmeng Ba
CC
2009
Springer
106views System Software» more  CC 2009»
14 years 2 months ago
Blind Optimization for Exploiting Hardware Features
Software systems typically exploit only a small fraction of the realizable performance from the underlying microprocessors. While there has been much work on hardware-aware optimiz...
Dan Knights, Todd Mytkowicz, Peter F. Sweeney, Mic...
DATE
2008
IEEE
165views Hardware» more  DATE 2008»
14 years 1 months ago
TinyTimber, Reactive Objects in C for Real-Time Embedded Systems
Embedded systems are often operating under hard real-time constraints. Such systems are naturally described as time-bound reactions to external events, a point of view made manife...
Per Lindgren, Johan Eriksson, Simon Aittamaa, Joha...