Sciweavers

400 search results - page 69 / 80
» What Makes a Problem GP-Hard
Sort
View
DGO
2011
237views Education» more  DGO 2011»
12 years 7 months ago
Modeling digital preservation capabilities in enterprise architecture
The rising awareness of the challenges of preserving information over the long term has led to a wealth of initiatives developing economic models, methods, tools, systems, guideli...
Christoph Becker, Gonçalo Antunes, Jos&eacu...
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
14 years 7 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
ASPLOS
2009
ACM
14 years 8 months ago
Producing wrong data without doing anything obviously wrong!
This paper presents a surprising result: changing a seemingly innocuous aspect of an experimental setup can cause a systems researcher to draw wrong conclusions from an experiment...
Todd Mytkowicz, Amer Diwan, Matthias Hauswirth, Pe...
KDD
2009
ACM
223views Data Mining» more  KDD 2009»
14 years 8 months ago
Collaborative filtering with temporal dynamics
Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are ...
Yehuda Koren
ASPLOS
2010
ACM
14 years 2 months ago
SherLog: error diagnosis by connecting clues from run-time logs
Computer systems often fail due to many factors such as software bugs or administrator errors. Diagnosing such production run failures is an important but challenging task since i...
Ding Yuan, Haohui Mai, Weiwei Xiong, Lin Tan, Yuan...