Sciweavers

2004 search results - page 314 / 401
» Sampling from large graphs
Sort
View
ICSE
2009
IEEE-ACM
13 years 7 months ago
HOLMES: Effective statistical debugging via efficient path profiling
Statistical debugging aims to automate the process of isolating bugs by profiling several runs of the program and using statistical analysis to pinpoint the likely causes of failu...
Trishul M. Chilimbi, Ben Liblit, Krishna K. Mehra,...
IFIP
2010
Springer
13 years 7 months ago
Drivers of B2B Software Purchase Decisions
. Organizations are increasingly turning to large, enterprise-wide software systems as potential solutions to managing complex business-to-business (B2B) relationships. These syste...
Claudia Loebbecke, Thomas Weiss, Philip Powell, Ch...
TNN
2010
154views Management» more  TNN 2010»
13 years 4 months ago
Discriminative semi-supervised feature selection via manifold regularization
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...
Zenglin Xu, Irwin King, Michael R. Lyu, Rong Jin
ICASSP
2011
IEEE
13 years 1 months ago
Combined compressed sensing and parallel mri compared for uniform and random cartesian undersampling of K-space
Both compressed sensing (CS) and parallel imaging effectively reconstruct magnetic resonance images from undersampled data. Combining both methods enables imaging with greater und...
Daniel S. Weller, Jonathan R. Polimeni, Leo Grady,...
JCDL
2011
ACM
226views Education» more  JCDL 2011»
13 years 27 days ago
Measuring historical word sense variation
We describe here a method for automatically identifying word sense variation in a dated collection of historical books in a large digital library. By leveraging a small set of kno...
David Bamman, Gregory Crane