Sciweavers

1529 search results - page 103 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
SAT
2007
Springer
73views Hardware» more  SAT 2007»
15 years 10 months ago
SAT Solving for Termination Analysis with Polynomial Interpretations
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
Carsten Fuhs, Jürgen Giesl, Aart Middeldorp, ...
ICCV
2005
IEEE
16 years 6 months ago
Segmentation of Hybrid Motions via Hybrid Quadratic Surface Analysis
In this paper, we investigate the mathematical problem underlying segmentation of hybrid motions: Given a series of tracked feature correspondences between two (perspective) image...
Shankar Rao, Allen Y. Yang, Andrew Wagner, Yi Ma
JAIR
2007
79views more  JAIR 2007»
15 years 4 months ago
Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
MST
2006
136views more  MST 2006»
15 years 4 months ago
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
Load balancing is a critical issue for the efficient operation of peerto-peer networks. We give two new load-balancing protocols whose provable performance guarantees are within a...
David R. Karger, Matthias Ruhl
ICML
2006
IEEE
16 years 4 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade