Sciweavers

199 search results - page 30 / 40
» Natural Language Specification of Performance Trees
Sort
View
ICALP
2010
Springer
14 years 21 days ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ISESE
2006
IEEE
14 years 1 months ago
Identifying domain-specific defect classes using inspections and change history
We present an iterative, reading-based methodology for analyzing defects in source code when change history is available. Our bottom-up approach can be applied to build knowledge ...
Taiga Nakamura, Lorin Hochstein, Victor R. Basili
CIKM
2005
Springer
14 years 1 months ago
A hybrid approach to NER by MEMM and manual rules
This paper describes a framework for defining domain specific Feature Functions in a user friendly form to be used in a Maximum Entropy Markov Model (MEMM) for the Named Entity Re...
Moshe Fresko, Binyamin Rosenfeld, Ronen Feldman
EDOC
2002
IEEE
14 years 26 days ago
On Expressing and Monitoring Behaviour in Contracts
This paper addresses the problem of transforming natural language descriptions of contracts into a form that is suitable for automating various contract management functions. We i...
Zoran Milosevic, R. Geoff Dromey