Sciweavers

26354 search results - page 104 / 5271
» How we refactor, and how we know it
Sort
View
CHI
2011
ACM
13 years 1 months ago
Determining relevancy: how software developers determine relevant information in feeds
Finding relevant information within the vast amount of information exchanged via feeds is difficult. Previous research into this problem has largely focused on recommending relev...
Thomas Fritz, Gail C. Murphy
SIGSOFT
2006
ACM
14 years 11 months ago
How is aliasing used in systems software?
We present a study of all sources of aliasing in over one million lines of C code, identifying in the process the common patterns of aliasing that arise in practice. We find that ...
Brian Hackett, Alex Aiken
KDD
2006
ACM
185views Data Mining» more  KDD 2006»
14 years 10 months ago
How to Define Searching Sessions on Web Search Engines
We investigate three methods for defining a session on Web search engines. We examine 2,465,145 interactions from 534,507 Web searchers. We compare defining sessions using: 1) Int...
Bernard J. Jansen, Amanda Spink, Vinish Kathuria
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 10 months ago
Privacy preservation of aggregates in hidden databases: why and how?
Many websites provide form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we explain the importance of protecting s...
Arjun Dasgupta, Nan Zhang, Gautam Das, Surajit Cha...
ICCAD
2008
IEEE
125views Hardware» more  ICCAD 2008»
14 years 7 months ago
Practical, fast Monte Carlo statistical static timing analysis: why and how
Statistical static timing analysis (SSTA) has emerged as an essential tool for nanoscale designs. Monte Carlo methods are universally employed to validate the accuracy of the appr...
Amith Singhee, Sonia Singhal, Rob A. Rutenbar