Sciweavers

7106 search results - page 67 / 1422
» Restricted Complexity, General Complexity
Sort
View
SPAA
2003
ACM
14 years 28 days ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
ICDE
1993
IEEE
103views Database» more  ICDE 1993»
13 years 12 months ago
IsaLog: A declarative language for complex objects with hierarchies
The IsaLog model and language are presented. The model has complex objects with classes, relations, and isa hierarchies. The language is strongly typed and declarative. The main i...
Paolo Atzeni, Luca Cabibbo, Giansalvatore Mecca
EURODAC
1995
IEEE
151views VHDL» more  EURODAC 1995»
13 years 11 months ago
Model of conceptual design of complex electronic systems
Due to the ever increasing complexity of electronic system (ES) design, the conceptual design phase and its realization in later phases of the design stream have become increasing...
Alexander N. Soloviev, Alexander L. Stempkovsky
EMNLP
2008
13 years 9 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
SODA
2000
ACM
85views Algorithms» more  SODA 2000»
13 years 9 months ago
Improved bounds on the sample complexity of learning
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
Yi Li, Philip M. Long, Aravind Srinivasan