Sciweavers

1254 search results - page 106 / 251
» Making Hard Problems Harder
Sort
View
SIGSOFT
2008
ACM
14 years 11 months ago
Extended exceptions for contingencies and their implications for the engineering process
We observed a general problem of sequential programs, which often results in design and programming errors in industrial software engineering projects, and propose a solution appr...
Thorsten van Ellen, Wilhelm Hasselbring
KDD
2009
ACM
237views Data Mining» more  KDD 2009»
14 years 10 months ago
Exploring social tagging graph for web object classification
This paper studies web object classification problem with the novel exploration of social tags. Automatically classifying web objects into manageable semantic categories has long ...
Zhijun Yin, Rui Li, Qiaozhu Mei, Jiawei Han
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 10 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
STOC
2005
ACM
156views Algorithms» more  STOC 2005»
14 years 10 months ago
Convex programming for scheduling unrelated parallel machines
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
Yossi Azar, Amir Epstein
SIGMOD
2009
ACM
269views Database» more  SIGMOD 2009»
14 years 10 months ago
Efficient approximate entity extraction with edit distance constraints
Named entity recognition aims at extracting named entities from unstructured text. A recent trend of named entity recognition is finding approximate matches in the text with respe...
Wei Wang 0011, Chuan Xiao, Xuemin Lin, Chengqi Zha...