Sciweavers

8824 search results - page 118 / 1765
» On the Complexity of Real Functions
Sort
View
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 4 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
ISSAC
1994
Springer
119views Mathematics» more  ISSAC 1994»
15 years 8 months ago
Branch Cuts in Computer Algebra
Many standard functions, such as the logarithm and square root functions, cannot be de ned continuously on the complex plane. Mistaken assumptions about the properties of these fu...
Adam Dingle, Richard J. Fateman
CIKM
2009
Springer
15 years 11 months ago
L2 norm regularized feature kernel regression for graph data
Features in many real world applications such as Cheminformatics, Bioinformatics and Information Retrieval have complex internal structure. For example, frequent patterns mined fr...
Hongliang Fei, Jun Huan
IPPS
1998
IEEE
15 years 8 months ago
A Resource Management Model for Dynamic, Scalable, Dependable, Real-Time Systems
Abstract. Dynamic real-time systems function in unpredictable environments and have requirements that span many domains such as time, survivability, and scalability. The system req...
Binoy Ravindran, Lonnie R. Welch, Carl Bruggeman, ...
DELTA
2004
IEEE
15 years 8 months ago
Static Scheduling of Monoprocessor Real-Time Systems composed of Hard and Soft Tasks
In this report we address the problem of static scheduling of realtime systems that include both hard and soft tasks. We consider systems in which both hard and soft tasks are per...
Luis Alejandro Cortés, Petru Eles, Zebo Pen...