Sciweavers

1666 search results - page 236 / 334
» Effective and efficient structured retrieval
Sort
View
TKDE
2008
191views more  TKDE 2008»
13 years 10 months ago
Beyond Single-Page Web Search Results
Given a user keyword query, current Web search engines return a list of individual Web pages ranked by their "goodness" with respect to the query. Thus, the basic unit fo...
Ramakrishna Varadarajan, Vagelis Hristidis, Tao Li
GVD
2009
162views Database» more  GVD 2009»
13 years 7 months ago
Archiving and Maintaining Curated Databases
Curated databases represent a substantial amount of effort by a dedicated group of people to produce a definitive description of some subject area. The value of curated databases ...
Heiko Müller
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 10 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
CVPR
2003
IEEE
15 years 3 days ago
Object Removal by Exemplar-Based Inpainting
A new algorithm is proposed for removing large objects from digital images. The challenge is to fill in the hole that is left behind in a visually plausible way. In the past, this...
Antonio Criminisi, Kentaro Toyama, Patrick P&eacut...
ESA
2008
Springer
99views Algorithms» more  ESA 2008»
13 years 12 months ago
Robust Kinetic Convex Hulls in 3D
Abstract. Kinetic data structures provide a framework for computing combinatorial properties of continuously moving objects. Although kinetic data structures for many problems have...
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, ...