Sciweavers

2585 search results - page 293 / 517
» computing 1999
Sort
View
ECCC
2006
90views more  ECCC 2006»
15 years 4 months ago
Comparing Reductions to NP-Complete Sets
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
John M. Hitchcock, Aduri Pavan
CSUR
1999
114views more  CSUR 1999»
15 years 4 months ago
Directions for Research in Approximate System Analysis
useful for optimizing compilers [15], partial evaluators [11], abstract debuggers [1], models-checkers [2], formal verifiers [13], etc. The difficulty of the task comes from the fa...
Patrick Cousot
UMUAI
2002
76views more  UMUAI 2002»
15 years 4 months ago
User Models and User Physical Capability
Current interface design practices are based on user models and descriptions derived almost exclusively from studies of able-bodied users (Keates et al., 1999). However, such users...
Simeon Keates, Patrick Langdon, P. John Clarkson, ...
ACL
2012
13 years 6 months ago
Unsupervized Word Segmentation: the Case for Mandarin Chinese
In this paper, we present an unsupervized segmentation system tested on Mandarin Chinese. Following Harris's Hypothesis in Kempe (1999) and Tanaka-Ishii's (2005) reformu...
Pierre Magistry, Benoît Sagot
ACL
2012
13 years 6 months ago
Labeling Documents with Timestamps: Learning from their Time Expressions
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
Nathanael Chambers