Sciweavers

2242 search results - page 236 / 449
» In Search Of An Accuracy Metric
Sort
View
SCCC
2003
IEEE
15 years 11 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes
IEAAIE
2001
Springer
15 years 11 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
MM
2000
ACM
98views Multimedia» more  MM 2000»
15 years 11 months ago
Key-frame extraction and shot retrieval using nearest feature line (NFL)
Query by key frame or video example is a convenient and often effective way to search in video database. This paper proposes a new approach to support such searches. The main cont...
Li Zhao, Wei Qi, Stan Z. Li, Shi-Qiang Yang, HongJ...
CIKM
1999
Springer
15 years 10 months ago
Rule-Based Query Optimization, Revisited
We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a general-purpose active-database rule language embedded in C+...
Lane Warshaw, Daniel P. Miranker
RSP
1998
IEEE
188views Control Systems» more  RSP 1998»
15 years 10 months ago
Performance and Interface Buffer Size Driven Behavioral Partitioning for Embedded Systems
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
T.-C. Lin, Sadiq M. Sait, Walling R. Cyre