Sciweavers

5889 search results - page 822 / 1178
» Graph Layout Problems
Sort
View
HCI
2007
15 years 8 months ago
An MDE-SOA Approach to Support Plastic User Interfaces in Ambient Spaces
User interface (UI) plasticity denotes UI adaptation to the context of use (user, platform, physical and social environment) while preserving usability. Our approach to this proble...
Joëlle Coutaz, Lionel Balme, X. Alvaro, Ga&eu...
NAACL
2007
15 years 8 months ago
Worst-Case Synchronous Grammar Rules
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
Daniel Gildea, Daniel Stefankovic
ACST
2006
15 years 8 months ago
An efficient search algorithm for partially ordered sets
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
Yan Chen
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
15 years 8 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
MVA
1998
230views Computer Vision» more  MVA 1998»
15 years 8 months ago
An Efficient Matching Algorithm for Segment-Based Stereo Vision Using Dynamic Programming Technique
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
Toshio Ueshiba, Yoshihiro Kawai, Yasushi Sumi, Fum...