Sciweavers

5523 search results - page 784 / 1105
» Improving application performance with hardware data structu...
Sort
View
KDD
2002
ACM
144views Data Mining» more  KDD 2002»
16 years 7 months ago
Efficiently mining frequent trees in a forest
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
Mohammed Javeed Zaki
ISWC
2006
IEEE
16 years 20 days ago
Towards Less Supervision in Activity Recognition from Wearable Sensors
Activity Recognition has gained a lot of interest in recent years due to its potential and usefulness for context-aware wearable computing. However, most approaches for activity r...
Tâm Huynh, Bernt Schiele
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 4 months ago
Trajectory Codes for Flash Memory
Abstract--Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the store...
Anxiao Jiang, Michael Langberg, Moshe Schwartz, Je...
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
16 years 6 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden
ACMMSP
2004
ACM
92views Hardware» more  ACMMSP 2004»
16 years 2 days ago
Instruction combining for coalescing memory accesses using global code motion
Instruction combining is an optimization to replace a sequence of instructions with a more efficient instruction yielding the same result in a fewer machine cycles. When we use it...
Motohiro Kawahito, Hideaki Komatsu, Toshio Nakatan...