Sciweavers

62 search results - page 9 / 13
» Approximating Node-Connectivity Augmentation Problems
Sort
View
GD
2004
Springer
14 years 28 days ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
APGV
2010
ACM
227views Visualization» more  APGV 2010»
13 years 11 months ago
Measuring the perception of light inconsistencies
In this paper we explore the ability of the human visual system to detect inconsistencies in the illumination of objects in images. We specifically focus on objects being lit fro...
Jorge Lopez-Moreno, Veronica Sundstedt, Francisco ...
CVPR
2003
IEEE
14 years 9 months ago
Constrained Subspace Modelling
When performing subspace modelling of data using Principal Component Analysis (PCA) it may be desirable to constrain certain directions to be more meaningful in the context of the...
Jaco Vermaak, Patrick Pérez
ICRA
2010
IEEE
135views Robotics» more  ICRA 2010»
13 years 6 months ago
Implicit nonlinear complementarity: A new approach to contact dynamics
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
Emanuel Todorov
DAM
2011
13 years 2 months ago
Matchability and k-maximal matchings
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen...