Sciweavers

3220 search results - page 599 / 644
» Constrained Graph Processes
Sort
View
102
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 28 days ago
The Dichotomy of List Homomorphisms for Digraphs
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
Pavol Hell, Arash Rafiey
158
Voted
AMDO
2010
Springer
15 years 19 days ago
Compatible Particles for Part-Based Tracking
Particle Filter methods are one of the dominant tracking paradigms due to its ability to handle non-gaussian processes, multimodality and temporal consistency. Traditionally, the e...
Brais Martínez, Marc Vivet, Xavier Binefa
89
Voted
GIS
2010
ACM
15 years 18 days ago
Cleaning massive sonar point clouds
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
Lars Arge, Kasper Green Larsen, Thomas Mølh...
142
Voted
IAT
2010
IEEE
15 years 18 days ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
132
Voted
SEMWEB
2010
Springer
15 years 14 days ago
Optimizing Enterprise-Scale OWL 2 RL Reasoning in a Relational Database System
OWL 2 RL was standardized as a less expressive but scalable subset of OWL 2 that allows a forward-chaining implementation. However, building an enterprise-scale forward-chaining ba...
Vladimir Kolovski, Zhe Wu, George Eadon