Sciweavers

2834 search results - page 500 / 567
» Representing Trees with Constraints
Sort
View
MICS
2010
102views more  MICS 2010»
14 years 11 months ago
On Conditional Covering Problem
The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
Balasubramanian Sivan, S. Harini, C. Pandu Rangan
PAMI
2010
156views more  PAMI 2010»
14 years 11 months ago
An Adaptive and Stable Method for Fitting Implicit Polynomial Curves and Surfaces
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...
Bo Zheng, Jun Takamatsu, Katsushi Ikeuchi
115
Voted
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
14 years 11 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
85
Voted
TCS
2010
14 years 11 months ago
On a special class of primitive words
When representing DNA molecules as words, it is necessary to take into account the fact that a word u encodes basically the same information as its Watson-Crick complement θ(u), w...
Elena Czeizler, Lila Kari, Shinnosuke Seki
TIP
2010
189views more  TIP 2010»
14 years 11 months ago
Image Inpainting by Patch Propagation Using Patch Sparsity
Abstract—This paper introduces a novel examplar-based inpainting algorithm through investigating the sparsity of natural image patches. Two novel concepts of sparsity at the patc...
Zongben Xu, Jian Sun