Sciweavers

811 search results - page 39 / 163
» An efficient algorithm for the configuration problem of domi...
Sort
View
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 8 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
ICPR
2000
IEEE
14 years 1 months ago
MRF Solutions for Probabilistic Optical Flow Formulations
In this paper we propose an efficient, non-iterative method for estimating optical flow. We develop a probabilistic framework that is appropriate for describing the inherent uncer...
Sébastien Roy, Venu Govindu
PVLDB
2010
135views more  PVLDB 2010»
13 years 5 months ago
Efficient Skyline Evaluation over Partially Ordered Domains
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consid...
Shiming Zhang, Nikos Mamoulis, Ben Kao, David Wai-...
ICCAD
2005
IEEE
141views Hardware» more  ICCAD 2005»
14 years 7 months ago
Architecture and compilation for data bandwidth improvement in configurable embedded processors
Many commercially available embedded processors are capable of extending their base instruction set for a specific domain of applications. While steady progress has been made in t...
Jason Cong, Guoling Han, Zhiru Zhang
FUIN
2006
139views more  FUIN 2006»
13 years 10 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale