Sciweavers

16666 search results - page 3009 / 3334
» Descriptive and Computational Complexity
Sort
View
SIAMREV
2011
63views more  SIAMREV 2011»
14 years 9 months ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
14 years 9 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
AAAI
2011
14 years 6 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
CCP
2011
136views more  CCP 2011»
14 years 6 months ago
Fast Implementation of Block Motion Estimation Algorithms in Video Encoders
This project will involve analysing some of the newer fast algorithms in comparison with an exhaustive full search algorithm for motion estimation in video encoders. It will invest...
Naga Rohini Koduri, Mqhele E. Dlodlo, Gerhard de J...
CATA
2000
15 years 8 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
« Prev « First page 3009 / 3334 Last » Next »