Sciweavers

26354 search results - page 162 / 5271
» How we refactor, and how we know it
Sort
View
DSVIS
2006
Springer
14 years 2 months ago
How Do Developers Meet Users? - Attitudes and Processes in Software Development
This keynote paper argues for an increased understanding of the various roles involved in the development work to be able to achieve the goal of developing increased usability. Hum...
Jan Gulliksen
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
14 years 2 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg
FSE
2008
Springer
110views Cryptology» more  FSE 2008»
14 years 3 days ago
How to Encrypt with a Malicious Random Number Generator
Chosen-plaintext attacks on private-key encryption schemes are currently modeled by giving an adversary access to an oracle that encrypts a given message m using random coins that ...
Seny Kamara, Jonathan Katz
LREC
2008
85views Education» more  LREC 2008»
13 years 12 months ago
POS Tagging for German: how important is the Right Context?
Part-of-Speech tagging is generally performed by Markov models, based on bigram or trigram models. While Markov models have a strong concentration on the left context of a word, m...
Steliana Ivanova, Sandra Kuebler
AAAI
2004
13 years 12 months ago
MAX-2-SAT: How Good Is Tabu Search in the Worst-Case?
Tabu search algorithms are amongst the most successful local search based methods for the maximum satisfiability problem. The practical superiority of tabu search over the local s...
Monaldo Mastrolilli, Luca Maria Gambardella