Sciweavers

69 search results - page 13 / 14
» Homomorphic Evaluation Requires Depth
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
EUROSYS
2007
ACM
14 years 6 months ago
Competitive prefetching for concurrent sequential I/O
During concurrent I/O workloads, sequential access to one I/O stream can be interrupted by accesses to other streams in the system. Frequent switching between multiple sequential ...
Chuanpeng Li, Kai Shen, Athanasios E. Papathanasio...
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 4 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
PAMI
2006
358views more  PAMI 2006»
13 years 9 months ago
Recovering 3D Human Pose from Monocular Images
We describe a learning based method for recovering 3D human body pose from single images and monocular image sequences. Our approach requires neither an explicit body model nor pri...
Ankur Agarwal, Bill Triggs
SAC
2002
ACM
13 years 9 months ago
Concurrency control for distributed cooperative engineering applications
Distributed cooperative engineering applications require consistent and long-term sharing of large volumes of data, which may cause conflicts due to concurrent read/write operatio...
João Coelho Garcia, Paulo Ferreira