Sciweavers

735 search results - page 119 / 147
» Evaluating Probabilistic Queries over Imprecise Data
Sort
View
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
16 years 1 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
ICPR
2002
IEEE
16 years 25 days ago
Building a Latent Semantic Index of an Image Database from Patterns of Relevance Feedback
This paper proposes a novel view of the information generated by relevance feedback. Latent semantic analysis is adapted to this view to extract useful inter-query information. Th...
Douglas R. Heisterkamp
IDEAS
2010
IEEE
141views Database» more  IDEAS 2010»
14 years 9 months ago
Modeling synchronized time series
Abstract. We consider the class of applications that manage time series (TS) and propose a data model and a query language that let these applications manipulate TS data sets at a ...
Zoé Faget, Philippe Rigaux, David Gross-Amb...
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
15 years 6 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
HIPEAC
2005
Springer
15 years 5 months ago
Exploiting a Computation Reuse Cache to Reduce Energy in Network Processors
Abstract. High end routers are targeted at providing worst case throughput guarantees over latency. Caches on the other hand are meant to help latency not throughput in a tradition...
Bengu Li, Ganesh Venkatesh, Brad Calder, Rajiv Gup...