Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
609
Loopy belief propagation for approximate inference: An empirical study. In:
- Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon-limit performanc ..."
Abstract
-
Cited by 676 (15 self)
- Add to MetaCart
Abstract Recently, researchers have demonstrated that "loopy belief propagation" -the use of Pearl's polytree algorithm in a Bayesian network with loops -can perform well in the context of error-correcting codes. The most dramatic instance of this is the near Shannon
Action Recognition by Dense Trajectories
, 2011
"... Feature trajectories have shown to be efficient for rep-resenting videos. Typically, they are extracted using the KLT tracker or matching SIFT descriptors between frames. However, the quality as well as quantity of these trajecto-ries is often not sufficient. Inspired by the recent success of dense ..."
Abstract
-
Cited by 293 (16 self)
- Add to MetaCart
sampling in image classification, we propose an approach to describe videos by dense trajectories. We sam-ple dense points from each frame and track them based on displacement information from a dense optical flow field. Given a state-of-the-art optical flow algorithm, our trajec-tories are robust to fast
ple Adaptive Attributes
"... ii The performances of most existing face recognition systems suffer from facial expressions. Unfortunately, there is not yet a satisfactory solution. Therefore, the main focus of this thesis is on expression-invariant face recognition algorithms. In this thesis, we first propose a 2D face recogniti ..."
Abstract
- Add to MetaCart
ii The performances of most existing face recognition systems suffer from facial expressions. Unfortunately, there is not yet a satisfactory solution. Therefore, the main focus of this thesis is on expression-invariant face recognition algorithms. In this thesis, we first propose a 2D face
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-dual algorithm
- Queueing Systems
, 2005
"... We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision \produces " a certain vector of \commodities"; it also has assoc ..."
Abstract
-
Cited by 204 (9 self)
- Add to MetaCart
is the average value of commodity vector, subject to the constraint that network queues remain stable. We introduce a dynamic control algorithm, which we call Greedy Primal-Dual (GPD) algorithm, and prove its asymptotic optimality. We show that our network model and GPD algorithm accommodate a wide range
The Gene Expression Messy Genetic Algorithm
- In Proceedings of the IEEE International Conference on Evolutionary Computation
, 1996
"... This paper introduces the gene expression messy genetic algorithm (GEMGA) a new generation of messy GAs that directly search for relations among the members of the search space. The GEMGA is an O(Ak( 2 q- k)) sam- ple complexity algorithm for the class of order-k deline- able problems [6] (problems ..."
Abstract
-
Cited by 102 (9 self)
- Add to MetaCart
This paper introduces the gene expression messy genetic algorithm (GEMGA) a new generation of messy GAs that directly search for relations among the members of the search space. The GEMGA is an O(Ak( 2 q- k)) sam- ple complexity algorithm for the class of order-k deline- able problems [6] (problems
Expectation-propagation for the generative aspect model
- in UAI-2000, Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence
"... The generative aspect model is an extension of the multinomial model for text that allows word probabilities to vary stochastically across docu-ments. Previous results with aspect models have been promising, but hindered by the computa-tional difficulty of carrying out inference and learning. This p ..."
Abstract
-
Cited by 157 (5 self)
- Add to MetaCart
. This paper demonstrates that the sim-ple variational methods of Blei et al. (2001) can lead to inaccurate inferences and biased learning for the generative aspect model. We develop an alternative approach that leads to higher accuracy at comparable cost. An extension of Expectation-Propagation is used
Efficient I ple entation of Path Processor on ulti-Core CP s
"... Abstract. Current XPath processors use direct approach to query eval-uation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case of processing complex queries on large documents. We propose algorithms and XML indexing techniques which are more effi ..."
Abstract
- Add to MetaCart
Abstract. Current XPath processors use direct approach to query eval-uation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case of processing complex queries on large documents. We propose algorithms and XML indexing techniques which are more
Boundary Recognition in Sensor Networks by Topological Me ods
- in Proc. of MOBICOM
, 2006
"... Wireless sensor networks are tightly associated with the un-derlying environment in which the sensors are deployed. The global topology of the network is of great importance to both sensor network applications and the implementation of net-working functionalities. In this paper we study the problem ..."
Abstract
-
Cited by 105 (17 self)
- Add to MetaCart
not assume any knowledge of the node locations or inter-distances, nor do we enforce that the communication graph follows the unit disk graph model. We propose a sim-ple, distributed algorithm that correctly detects nodes on the boundaries and connects them into meaningful bound-ary cycles. We obtain as a
Random instances of w[2]-complete problems: thresholds, complexity, and algorithms
- In Proceedings of 11th International Conference on Theory and Applications of Satisfiability Testing (SAT’08
"... Abstract. The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems as well as the strength and weakness of well-founded heuristics. This work is part of our effort to extend this line of research to intractable pa ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
. The behavior of these sim-ple algorithms may help shed light on the observation that small-sized backdoor sets can be effectively exploited by some randomized DPLL-style solvers. We establish lower bounds for a parameterized version of the ordered DPLL resolution proof procedure for unsatisfiable random
Perfect Simulation from Non-neutral Population Genetic Models: Variable Population Size and Population sub-division
"... Summary: We show how the idea of monotone coupling from the past can produce sim-ple algorithms for simulating samples at a non-neutral locus under a range of demographic models. We specifically consider a biallelic locus, and either a general variable population size mode, or a general migration mo ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
Summary: We show how the idea of monotone coupling from the past can produce sim-ple algorithms for simulating samples at a non-neutral locus under a range of demographic models. We specifically consider a biallelic locus, and either a general variable population size mode, or a general migration
Results 1 - 10
of
609
