Sciweavers

13457 search results - page 33 / 2692
» Can we elect if we cannot compare
Sort
View
CLUSTER
2009
IEEE
14 years 2 months ago
Analyzing massive astrophysical datasets: Can Pig/Hadoop or a relational DBMS help?
Abstract— As the datasets used to fuel modern scientific discovery grow increasingly large, they become increasingly difficult to manage using conventional software. Parallel d...
Sarah Loebman, Dylan Nunley, YongChul Kwon, Bill H...
SEKE
2010
Springer
13 years 5 months ago
Specification patterns can be formal and still easy
Abstract--Property specification is still one of the most challenging tasks for transference of software verification technology like model checking. The use of patterns has been p...
Fernando Asteasuain, Víctor A. Braberman
AI
2007
Springer
13 years 7 months ago
Anyone but him: The complexity of precluding an alternative
Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preferen...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
CRV
2007
IEEE
145views Robotics» more  CRV 2007»
14 years 1 months ago
Can Lucas-Kanade be used to estimate motion parallax in 3D cluttered scenes?
When an observer moves in a 3D static scene, the motion field depends on the depth of the visible objects and on the observer’s instantaneous translation and rotation. By compu...
Vincent Chapdelaine-Couture, Michael S. Langer
CVPR
2000
IEEE
14 years 9 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu