Sciweavers

999 search results - page 50 / 200
» Constraints in Non-Boolean Contexts
Sort
View
APIN
2006
109views more  APIN 2006»
15 years 6 months ago
Visual analogy: Viewing analogical retrieval and mapping as constraint satisfaction problems
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...
Patrick W. Yaner, Ashok K. Goel
DKE
2007
129views more  DKE 2007»
15 years 6 months ago
First-order temporal pattern mining with regular expression constraints
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting seque...
Sandra de Amo, Daniel A. Furtado
WEA
2010
Springer
330views Algorithms» more  WEA 2010»
16 years 1 months ago
Exact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
Frank Baumann, Christoph Buchheim, Frauke Liers
SSDBM
2009
IEEE
116views Database» more  SSDBM 2009»
16 years 27 days ago
Constraint-Based Learning of Distance Functions for Object Trajectories
Abstract. With the drastic increase of object trajectory data, the analysis and exploration of trajectories has become a major research focus with many applications. In particular,...
Wei Yu, Michael Gertz
ICASSP
2008
IEEE
16 years 19 days ago
Time-frequency localization from sparsity constraints
In the case of multicomponent AM-FM signals, the idealized representation which consists of weighted trajectories on the time-frequency (TF) plane, is intrinsically sparse. Recent...
Pierre Borgnat, Patrick Flandrin