Sciweavers

19798 search results - page 329 / 3960
» Is Structural Subtyping Useful
Sort
View
WWW
2011
ACM
14 years 9 months ago
Web information extraction using Markov logic networks
In this paper, we consider the problem of extracting structured data from web pages taking into account both the content of individual attributes as well as the structure of pages...
Sandeepkumar Satpal, Sahely Bhadra, Sundararajan S...
CIKM
2004
Springer
15 years 8 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
CGF
2008
141views more  CGF 2008»
15 years 3 months ago
Accelerating Ray Tracing using Constrained Tetrahedralizations
In this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization ...
Ares Lagae, Philip Dutré
116
Voted
SIGCSE
1997
ACM
121views Education» more  SIGCSE 1997»
15 years 7 months ago
Application-based modules using apprentice learning for CS 2
A typical Data Structures (CS 2) course covers a wide variety of topics: elementary algorithm analysis; data structures including dynamic structures, trees, tables, graphs, etc.; ...
Owen L. Astrachan, Robert F. Smith, James T. Wilke...
137
Voted
TIP
2010
189views more  TIP 2010»
15 years 1 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