Sciweavers

1236 search results - page 96 / 248
» Prefix-Like Complexities and Computability in the Limit
Sort
View
ICCV
2007
IEEE
15 years 12 months ago
Structure from Statistics - Unsupervised Activity Analysis using Suffix Trees
Models of activity structure for unconstrained environments are generally not available a priori. Recent representational approaches to this end are limited by their computational...
Raffay Hamid, Siddhartha Maddi, Aaron F. Bobick, I...
ECCV
2002
Springer
15 years 11 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
WWW
2005
ACM
15 years 10 months ago
On the feasibility of low-rank approximation for personalized PageRank
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
András A. Benczúr, Károly Csa...
CP
2009
Springer
15 years 10 months ago
Constraint-Based Optimal Testing Using DNNF Graphs
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
Anika Schumann, Martin Sachenbacher, Jinbo Huang
SIGMOD
2008
ACM
125views Database» more  SIGMOD 2008»
15 years 10 months ago
Categorical skylines for streaming data
The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-or...
Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. ...