Sciweavers

266 search results - page 14 / 54
» An Architecture for Fast Processing of Large Unstructured Da...
Sort
View
DPD
2006
141views more  DPD 2006»
13 years 8 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
DAC
2007
ACM
14 years 9 months ago
Fast Second-Order Statistical Static Timing Analysis Using Parameter Dimension Reduction
The ability to account for the growing impacts of multiple process variations in modern technologies is becoming an integral part of nanometer VLSI design. Under the context of ti...
Zhuo Feng, Peng Li, Yaping Zhan
ACSC
2006
IEEE
14 years 2 months ago
A framework for visual data mining of structures
Visual data mining has been established to effectively analyze large, complex numerical data sets. Especially, the extraction and visualization of inherent structures such as hie...
Hans-Jörg Schulz, Thomas Nocke, Heidrun Schum...
WWW
2008
ACM
14 years 9 months ago
Temporal views over rdf data
Supporting fast access to large RDF stores has been one of key challenges for enabling use of the Semantic Web in real-life applications, more so in sensor-based systems where lar...
Craig Sayers, Geetha Manjunath, K. S. Venugopal, R...
ICCV
2009
IEEE
13 years 6 months ago
Fast realistic multi-action recognition using mined dense spatio-temporal features
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
Andrew Gilbert, John Illingworth, Richard Bowden