Sciweavers

1525 search results - page 170 / 305
» Matching with Regular Constraints
Sort
View
ASE
2010
129views more  ASE 2010»
15 years 4 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
JGAA
2007
135views more  JGAA 2007»
15 years 4 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
CVPR
2005
IEEE
16 years 6 months ago
A Unified Optimization Based Learning Method for Image Retrieval
In this paper, an optimization based learning method is proposed for image retrieval from graph model point of view. Firstly, image retrieval is formulated as a regularized optimi...
Hanghang Tong, Jingrui He, Mingjing Li, Wei-Ying M...
ICML
2007
IEEE
16 years 5 months ago
More efficiency in multiple kernel learning
An efficient and general multiple kernel learning (MKL) algorithm has been recently proposed by Sonnenburg et al. (2006). This approach has opened new perspectives since it makes ...
Alain Rakotomamonjy, Francis Bach, Stéphane...
CHI
2005
ACM
16 years 4 months ago
Breaking the laws of action in the user interface
Fitts' law, Steering law and Law of crossing, collectively known as the laws of action, model the speed-accuracy tradeoffs in common HCI tasks. These laws impose a certain sp...
Per Ola Kristensson