Sciweavers

11784 search results - page 554 / 2357
» Interpolation for data structures
Sort
View
DATESO
2009
119views Database» more  DATESO 2009»
15 years 4 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 4 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG
FTDB
2008
82views more  FTDB 2008»
15 years 7 months ago
Information Extraction
The automatic extraction of information from unstructured sources has opened up new avenues for querying, organizing, and analyzing data by drawing upon the clean semantics of str...
Sunita Sarawagi
ICDM
2008
IEEE
96views Data Mining» more  ICDM 2008»
16 years 1 months ago
Filling in the Blanks - Krimp Minimisation for Missing Data
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
Jilles Vreeken, Arno Siebes
SEMWEB
2007
Springer
16 years 1 months ago
Potluck: Data Mash-Up Tool for Casual Users
As more and more reusable structured data appears on the Web, casual users will want to take into their own hands the task of mashing up data rather than wait for mash-up sites to ...
David F. Huynh, Robert C. Miller, David R. Karger