Sciweavers

831 search results - page 11 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
ICDM
2007
IEEE
179views Data Mining» more  ICDM 2007»
14 years 2 months ago
GDClust: A Graph-Based Document Clustering Technique
This paper introduces a new technique of document clustering based on frequent senses. The proposed system, GDClust (Graph-Based Document Clustering) works with frequent senses ra...
M. Shahriar Hossain, Rafal A. Angryk
EUROSYS
2011
ACM
12 years 11 months ago
Finding complex concurrency bugs in large multi-threaded applications
Parallel software is increasingly necessary to take advantage of multi-core architectures, but it is also prone to concurrency bugs which are particularly hard to avoid, find, an...
Pedro Fonseca, Cheng Li, Rodrigo Rodrigues
EOR
2010
113views more  EOR 2010»
13 years 5 months ago
Combining integer programming and the randomization method to schedule employees
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
Armann Ingolfsson, Fernanda Campello, Xudong Wu, E...
WWW
2008
ACM
14 years 8 months ago
Finding the right facts in the crowd: factoid question answering over social media
Community Question Answering has emerged as a popular and effective paradigm for a wide range of information needs. For example, to find out an obscure piece of trivia, it is now ...
Jiang Bian, Yandong Liu, Eugene Agichtein, Hongyua...
ISCI
2008
166views more  ISCI 2008»
13 years 7 months ago
Incremental and interactive mining of web traversal patterns
Web mining involves the application of data mining techniques to large amounts of web-related data in order to improve web services. Web traversal pattern mining involves discover...
Yue-Shi Lee, Show-Jane Yen