Sciweavers

1813 search results - page 162 / 363
» Instance Pruning Techniques
Sort
View
ICDE
1998
IEEE
270views Database» more  ICDE 1998»
16 years 7 months ago
Cyclic Association Rules
We study the problem of discovering association rules that display regular cyclic variation over time. For example, if we compute association rules over monthly sales data, we may...
Banu Özden, Sridhar Ramaswamy, Abraham Silber...
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
16 years 6 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
ICCAD
2006
IEEE
108views Hardware» more  ICCAD 2006»
16 years 3 months ago
Soft error reduction in combinational logic using gate resizing and flipflop selection
Soft errors in logic are emerging as a significant reliability problem for VLSI designs. This paper presents novel circuit optimization techniques to mitigate soft error rates (SE...
Rajeev R. Rao, David Blaauw, Dennis Sylvester
VLDB
2007
ACM
94views Database» more  VLDB 2007»
16 years 17 days ago
iTrails: Pay-as-you-go Information Integration in Dataspaces
Dataspace management has been recently identified as a new agenda for information management [17, 22] and information integration [23]. In sharp contrast to standard information ...
Marcos Antonio Vaz Salles, Jens-Peter Dittrich, Sh...
CASES
2006
ACM
16 years 13 days ago
Scalable subgraph mapping for acyclic computation accelerators
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
Nathan Clark, Amir Hormati, Scott A. Mahlke, Sami ...