Sciweavers

28888 search results - page 337 / 5778
» Computability and complexity in analysis
Sort
View
SAC
2006
ACM
16 years 21 days ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
WWW
2011
ACM
15 years 1 months ago
A word at a time: computing word relatedness using temporal semantic analysis
Computing the degree of semantic relatedness of words is a key functionality of many language applications such as search, clustering, and disambiguation. Previous approaches to c...
Kira Radinsky, Eugene Agichtein, Evgeniy Gabrilovi...
GEOS
2007
Springer
16 years 27 days ago
Supporting Complex Thematic, Spatial and Temporal Queries over Semantic Web Data
Spatial and temporal data are critical components in many applications. This is especially true in analytical domains such as national security and criminal investigation. Often, t...
Matthew Perry, Amit P. Sheth, Farshad Hakimpour, P...
DATE
2006
IEEE
115views Hardware» more  DATE 2006»
16 years 24 days ago
Management of complex automotive communication networks
Automakers are still facing an increasing complexity in vehicle requirements with regard to their EE systems. This complexity is not only caused by innovations, which are being pr...
Thomas Weber
CCA
2009
Springer
15 years 10 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi