Sciweavers

14518 search results - page 397 / 2904
» Two Problems for Sophistication
Sort
View
ICIP
2008
IEEE
16 years 8 months ago
LASIC: A model invariant framework for correspondence
In this paper we address two closely related problems. The first is the object detection problem, i.e., the automatic decision of whether a given image represents a known object o...
Bernardo Rodrigues Pires, João Xavier, Jos&...
CPM
2006
Springer
176views Combinatorics» more  CPM 2006»
15 years 10 months ago
Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
Alexandre Tiskin
FCS
2007
15 years 8 months ago
The Complexity of Futile Questioning
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
Anja Remshagen, Klaus Truemper
IWANN
2007
Springer
16 years 29 days ago
Non-parametric Residual Variance Estimation in Supervised Learning
The residual variance estimation problem is well-known in statistics and machine learning with many applications for example in the field of nonlinear modelling. In this paper, we...
Elia Liitiäinen, Amaury Lendasse, Francesco C...
IPL
2010
158views more  IPL 2010»
15 years 4 months ago
Finding bipartite subgraphs efficiently
Polynomial algorithms are given for the following two problems:
Dhruv Mubayi, György Turán