Sciweavers

7082 search results - page 1325 / 1417
» A framework for mobile evaluation
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
16 years 4 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
16 years 4 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
CHI
2004
ACM
16 years 4 months ago
Automatic support for web user studies with SCONE and TEA
This paper describes the concepts of TEA, a flexible tool that supports user tests by automating repetitive tasks and collecting data of user inputs and actions. TEA was specifica...
Hartmut Obendorf, Harald Weinreich, Torsten Hass
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 4 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
16 years 4 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
« Prev « First page 1325 / 1417 Last » Next »