Sciweavers

3898 search results - page 578 / 780
» On the Bit Extraction Problem
Sort
View
CASCON
1996
77views Education» more  CASCON 1996»
15 years 7 months ago
Harvesting design for an application framework
Framework design begins with domain analysis. Either the problem domain is analyzed to create a new design, or the solution domain is analyzed to understand how the problem has al...
Joan Boone
AAAI
2010
15 years 6 months ago
Computing Cost-Optimal Definitely Discriminating Tests
The goal of testing is to discriminate between multiple hypotheses about a system--for example, different fault diagnoses--by applying input patterns and verifying or falsifying t...
Anika Schumann, Jinbo Huang, Martin Sachenbacher
BMCBI
2007
154views more  BMCBI 2007»
15 years 6 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
CGF
2010
218views more  CGF 2010»
15 years 6 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
CORR
2010
Springer
177views Education» more  CORR 2010»
15 years 6 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec