Sciweavers

771 search results - page 96 / 155
» Methods for Measuring Search Engine Performance over Time
Sort
View
ISPD
2003
ACM
89views Hardware» more  ISPD 2003»
14 years 1 months ago
Local unidirectional bias for smooth cutsize-delay tradeoff in performance-driven bipartitioning
Traditional multilevel partitioning approaches have shown good performance with respect to cutsize, but offer no guarantees with respect to system performance. Timing-driven part...
Andrew B. Kahng, Xu Xu
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 1 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
IUI
2012
ACM
12 years 3 months ago
Mobile texting: can post-ASR correction solve the issues? an experimental study on gain vs. costs
The next big step in embedded, mobile speech recognition will be to allow completely free input as it is needed for messaging like SMS or email. However, unconstrained dictation r...
Michael Feld, Saeedeh Momtazi, Farina Freigang, Di...
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
ML
2006
ACM
13 years 7 months ago
Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. A common way to measure performance in these domains is to use precision and recall i...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik