Sciweavers

9949 search results - page 1875 / 1990
» On the Network Complexity of Selection
Sort
View
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
13 years 19 days ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
PAMI
2011
12 years 11 months ago
Hidden Part Models for Human Action Recognition: Probabilistic versus Max Margin
—We present a discriminative part-based approach for human action recognition from video sequences using motion features. Our model is based on the recently proposed hidden condi...
Yang Wang 0003, Greg Mori
PAMI
2011
12 years 11 months ago
Construction of Iso-Contours, Bisectors, and Voronoi Diagrams on Triangulated Surfaces
—In the research of computer vision and machine perception, three-dimensional objects are usually represented by 2-manifold triangular meshes M. In this paper, we present practic...
Yong-Jin Liu, Zhanqing Chen, Kai Tang
SAC
2011
ACM
12 years 11 months ago
A semantically rich approach for collaborative model edition
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
Jonathan Michaux, Xavier Blanc, Marc Shapiro, Pier...
AAAI
2011
12 years 9 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
« Prev « First page 1875 / 1990 Last » Next »