Sciweavers

137 search results - page 17 / 28
» Cross-Serial Dependencies Are Not Hard to Process
Sort
View
C3S2E
2008
ACM
14 years 11 months ago
Context-sensitive cut, copy, and paste
Creating and editing source code are tedious and error-prone processes. One important source of errors in editing programs is the failure to correctly adapt a block of copied code...
Reid Kerr, Wolfgang Stürzlinger
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
15 years 10 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
15 years 10 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
KDD
2007
ACM
153views Data Mining» more  KDD 2007»
15 years 10 months ago
Exploiting duality in summarization with deterministic guarantees
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
Panagiotis Karras, Dimitris Sacharidis, Nikos Mamo...
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
15 years 10 months ago
Group formation in large social networks: membership, growth, and evolution
The processes by which communities come together, attract new members, and develop over time is a central research issue in the social sciences -- political movements, professiona...
Lars Backstrom, Daniel P. Huttenlocher, Jon M. Kle...