Sciweavers

1489 search results - page 26 / 298
» Optimizing Feature Sets for Structured Data
Sort
View
IJCV
1998
233views more  IJCV 1998»
13 years 7 months ago
A Level-Set Approach to 3D Reconstruction from Range Data
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
Ross T. Whitaker
MFCS
2009
Springer
14 years 2 months ago
On the Structure of Optimal Greedy Computation (for Job Scheduling)
We consider Priority Algorithm [BNR03] as a syntactic model of formulating the concept of greedy algorithm for Job Scheduling, and we study the computation of optimal priority alg...
Periklis A. Papakonstantinou
CIKM
2006
Springer
13 years 11 months ago
Mining compressed commodity workflows from massive RFID data sets
Radio Frequency Identification (RFID) technology is fast becoming a prevalent tool in tracking commodities in supply chain management applications. The movement of commodities thr...
Hector Gonzalez, Jiawei Han, Xiaolei Li
FIW
2009
101views Communications» more  FIW 2009»
13 years 5 months ago
Feature Interaction Detection in the Feature Language Extensions
One of the most difficult tasks in software development is that features are implemented by changing the code of other features. This problem cannot be solved with existing general...
Lei Sun, Lu Zhoa, Yimeng Li, Wu-Hon F. Leung
EDBT
2000
ACM
13 years 12 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel