Sciweavers

3020 search results - page 504 / 604
» Optimal partition trees
Sort
View
JAIR
1998
97views more  JAIR 1998»
15 years 6 months ago
The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference
It is common to view programs as a combination of logic and control: the logic part de nes what the program must do, the control part how to do it. The Logic Programming paradigm ...
Oleg Ledeniov, Shaul Markovitch
TCSV
2002
229views more  TCSV 2002»
15 years 6 months ago
Automatic segmentation of moving objects in video sequences: a region labeling approach
Abstract--The emerging video coding standard MPEG-4 enables various content-based functionalities for multimedia applications. To support such functionalities, as well as to improv...
Yaakov Tsaig, Amir Averbuch
ML
2007
ACM
101views Machine Learning» more  ML 2007»
15 years 5 months ago
A persistent union-find data structure
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
Sylvain Conchon, Jean-Christophe Filliâtre
PC
2007
133views Management» more  PC 2007»
15 years 5 months ago
Data distribution for dense factorization on computers with memory heterogeneity
In this paper, we study the problem of optimal matrix partitioning for parallel dense factorization on heterogeneous processors. First, we outline existing algorithms solving the ...
Alexey L. Lastovetsky, Ravi Reddy
TSP
2008
134views more  TSP 2008»
15 years 5 months ago
A Mapping-Based Design for Nonsubsampled Hourglass Filter Banks in Arbitrary Dimensions
Multidimensional hourglass filter banks decompose the frequency spectrum of input signals into hourglass-shaped directional subbands, each aligned with one of the frequency axes. T...
Yue M. Lu, Minh N. Do