Sciweavers

559 search results - page 83 / 112
» Fast SDP Algorithms for Constraint Satisfaction Problems
Sort
View
IUI
2004
ACM
14 years 2 months ago
SUPPLE: automatically generating user interfaces
In order to give people ubiquitous access to software applications, device controllers, and Internet services, it will be necessary to automatically adapt user interfaces to the c...
Krzysztof Gajos, Daniel S. Weld
ASPDAC
2004
ACM
96views Hardware» more  ASPDAC 2004»
14 years 15 days ago
Rate analysis for streaming applications with on-chip buffer constraints
While mapping a streaming (such as multimedia or network packet processing) application onto a specified architecture, an important issue is to determine the input stream rates tha...
Alexander Maxiaguine, Simon Künzli, Samarjit ...
TALG
2010
110views more  TALG 2010»
13 years 7 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
CVPR
2001
IEEE
14 years 10 months ago
Understanding Popout through Repulsion
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
Stella X. Yu, Jianbo Shi
CP
2005
Springer
14 years 2 months ago
Symmetry and Consistency
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Ro...