1225 search results - page 69 / 245 » The Instance Complexity Conjecture |
111
Voted
ICDM
2008
IEEE
15 years 9 months ago
2008
IEEE
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
NAACL
2007
15 years 4 months ago
2007
Relation extraction is the task of finding semantic relations between entities from text. The state-of-the-art methods for relation extraction are mostly based on statistical lea...
112
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
176
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
134
Voted
HYBRID
2000
Springer
15 years 6 months ago
2000
Springer
This paper reports on an on-going project to investigate techniques to diagnose complex dynamical systems that are modeled as hybrid systems. In particular, we examine continuous s...