Sciweavers

7648 search results - page 1207 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
SIGMOD
2008
ACM
136views Database» more  SIGMOD 2008»
16 years 4 months ago
Mining relationships among interval-based events for classification
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
Dhaval Patel, Wynne Hsu, Mong-Li Lee
124
Voted
SIGMOD
2004
ACM
100views Database» more  SIGMOD 2004»
16 years 4 months ago
Cost-Based Labeling of Groups of Mass Spectra
We make two main contributions in this paper. First, we motivate and introduce a novel class of data mining problems that arise in labeling a group of mass spectra, specifically f...
Lei Chen 0003, Zheng Huang, Raghu Ramakrishnan
WSDM
2009
ACM
131views Data Mining» more  WSDM 2009»
15 years 10 months ago
Diversifying search results
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
Rakesh Agrawal, Sreenivas Gollapudi, Alan Halverso...
IPSN
2009
Springer
15 years 10 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
WADS
2007
Springer
115views Algorithms» more  WADS 2007»
15 years 10 months ago
Priority Queues Resilient to Memory Faults
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
Allan Grønlund Jørgensen, Gabriel Mo...
« Prev « First page 1207 / 1530 Last » Next »