Sciweavers

307 search results - page 43 / 62
» A Comparison of Algorithms for Connected Set Openings and Cl...
Sort
View
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
14 years 20 days ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
AIIA
2005
Springer
14 years 29 days ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut
VMV
2008
187views Visualization» more  VMV 2008»
13 years 8 months ago
Patch-Graph Reconstruction for Piecewise Smooth Surfaces
In this paper we present a new surface reconstruction technique for piecewise smooth surfaces from point clouds, such as scans of architectural sites or man-made artifacts. The te...
Philipp Jenke, Michael Wand, Wolfgang Straße...
ECCV
2008
Springer
13 years 9 months ago
Multiple Instance Boost Using Graph Embedding Based Decision Stump for Pedestrian Detection
Pedestrian detection in still image should handle the large appearance and stance variations arising from the articulated structure, various clothing of human as well as viewpoints...
Junbiao Pang, Qingming Huang, Shuqiang Jiang
ECIR
2006
Springer
13 years 8 months ago
Intrinsic Plagiarism Detection
Current research in the field of automatic plagiarism detection for text documents focuses on algorithms that compare plagiarized documents against potential original documents. Th...
Sven Meyer zu Eissen, Benno Stein