Sciweavers

1554 search results - page 265 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
151
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Near-field array shape calibration
In the important domain of array shape calibration, the near-field case poses a challenging problem due to the array response complexity induced by the range effect. In this pape...
Shuang Wan, Pei-Jung Chung, Bernard Mulgrew
ICDE
2011
IEEE
207views Database» more  ICDE 2011»
14 years 6 months ago
Monte Carlo query processing of uncertain multidimensional array data
— Array database systems are architected for scientific and engineering applications. In these applications, the value of a cell is often imprecise and uncertain. There are at le...
Tingjian Ge, David Grabiner, Stanley B. Zdonik
TVCG
2012
181views Hardware» more  TVCG 2012»
13 years 5 months ago
Interactive Image Segmentation Based on Level Sets of Probabilities
—In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topol...
Yugang Liu, Yizhou Yu
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 2 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
15 years 9 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...