Sciweavers

1058 search results - page 212 / 212
» Storage and Retrieval of XML Data using Relational Databases
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
TKDE
2011
234views more  TKDE 2011»
13 years 6 days ago
The World in a Nutshell: Concise Range Queries
—With the advance of wireless communication technology, it is quite common for people to view maps or get related services from the handheld devices, such as mobile phones and PD...
Ke Yi, Xiang Lian, Feifei Li, Lei Chen 0002
CVPR
2000
IEEE
14 years 7 months ago
Improving Visual Matching
Many visual matching algorithms can be described in terms of the features and the inter-feature distance or metric. The most commonly used metric is the sum of squared di erences ...
Michael S. Lew, Nicu Sebe, Thomas S. Huang