Sciweavers

370 search results - page 48 / 74
» Computational Study on Dominating Set Problem of Planar Grap...
Sort
View
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
15 years 6 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
NIPS
2003
15 years 1 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
SIGOPS
2010
162views more  SIGOPS 2010»
14 years 10 months ago
Visual and algorithmic tooling for system trace analysis: a case study
Despite advances in the application of automated statistical and machine learning techniques to system log and trace data there will always be a need for human analysis of machine...
Wim De Pauw, Steve Heisig
PAMI
2008
198views more  PAMI 2008»
14 years 11 months ago
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
Richard Szeliski, Ramin Zabih, Daniel Scharstein, ...
CORR
2007
Springer
80views Education» more  CORR 2007»
14 years 11 months ago
Uniqueness Domains in the Workspace of Parallel Manipulators
This work investigates new kinematic features of parallel manipulators. It is well known that parallel manipulators admit generally several direct kinematic solutions for a given ...
Philippe Wenger, Damien Chablat