Sciweavers

261 search results - page 10 / 53
» Application domain independent policy conflict analysis usin...
Sort
View
BALT
2010
14 years 4 months ago
Bringing Domain Knowledge to Pattern Matching
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
Agris Sostaks
102
Voted
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
PRL
2010
173views more  PRL 2010»
14 years 7 months ago
Resolving stereo matching errors due to repetitive structures using model information
This study regards the problem of incorrect stereo matches due to the occurrence of repetitive structures in the scene. In stereo vision, repetitive structures may lead to “phan...
Björn Barrois, Marcus Konrad, Christian W&oum...
CCS
2008
ACM
14 years 11 months ago
User-controllable learning of security and privacy policies
Studies have shown that users have great difficulty specifying their security and privacy policies in a variety of application domains. While machine learning techniques have succ...
Patrick Gage Kelley, Paul Hankes Drielsma, Norman ...
MM
2006
ACM
113views Multimedia» more  MM 2006»
15 years 3 months ago
Transductive inference using multiple experts for brushwork annotation in paintings domain
Many recent studies perform annotation of paintings based on brushwork. In these studies the brushwork is modeled indirectly as part of the annotation of high-level artistic conce...
Yelizaveta Marchenko, Tat-Seng Chua, Ramesh Jain