Sciweavers

325 search results - page 62 / 65
» Alternatives to two classic data structures
Sort
View
DAC
2000
ACM
15 years 10 months ago
Code compression for low power embedded system design
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
Haris Lekatsas, Jörg Henkel, Wayne Wolf
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
15 years 9 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
ICDT
1999
ACM
72views Database» more  ICDT 1999»
15 years 1 months ago
On the Generation of 2-Dimensional Index Workloads
A large number of database index structures have been proposed over the last two decades, and little consensus has emerged regarding their relative e ectiveness. In order to empir...
Joseph M. Hellerstein, Lisa Hellerstein, George Ko...
PVLDB
2008
126views more  PVLDB 2008»
14 years 9 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
SSPR
2010
Springer
14 years 8 months ago
Information Theoretical Kernels for Generative Embeddings Based on Hidden Markov Models
Many approaches to learning classifiers for structured objects (e.g., shapes) use generative models in a Bayesian framework. However, state-of-the-art classifiers for vectorial d...
André F. T. Martins, Manuele Bicego, Vittor...