Sciweavers

2512 search results - page 66 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
DKE
2006
139views more  DKE 2006»
14 years 9 months ago
Information extraction from structured documents using k-testable tree automaton inference
Information extraction (IE) addresses the problem of extracting specific information from a collection of documents. Much of the previous work on IE from structured documents, suc...
Raymond Kosala, Hendrik Blockeel, Maurice Bruynoog...
ALGORITHMICA
2005
76views more  ALGORITHMICA 2005»
14 years 9 months ago
Characterizing History Independent Data Structures
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...
Jason D. Hartline, Edwin S. Hong, Alexander E. Moh...
MICCAI
1998
Springer
15 years 2 months ago
Constrained Elastic Surface Nets: Generating Smooth Surfaces from Binary Segmented Data
This paper describes a method for creating object surfaces from binary-segmented data that are free from aliasing and terracing artifacts. In this method, a net of linked surface n...
Sarah F. Frisken Gibson
ICML
2003
IEEE
15 years 10 months ago
Learning with Knowledge from Multiple Experts
The use of domain knowledge in a learner can greatly improve the models it produces. However, high-quality expert knowledge is very difficult to obtain. Traditionally, researchers...
Matthew Richardson, Pedro Domingos
ISBI
2006
IEEE
15 years 10 months ago
Tissue characterization and detection of dysplasia using scattered light
In this paper, the structural parameters of dysplasia formation in the epithelial tissue are estimated using a stochastic decomposition algorithm (SDM) by means of scattered light...
Fernand S. Cohen, Ezgi Taslidere, Dilip S. Hari