886 search results - page 51 / 178 » Generalized Bezout Identity |
COLOGNETWENTE
2010
13 years 7 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
RTAS
2011
IEEE
13 years 1 months ago
2011
IEEE
The partitioned preemptive EDF scheduling of implicitdeadline sporadic task systems on an identical multiprocessor platform is considered. Lookup tables, at any selected degree of...
NIPS
2007
13 years 10 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
IAT
2006
IEEE
14 years 3 months ago
2006
IEEE
Trust negotiation makes it possible for two parties to carry on secure transactions by first establishing trust through a bilateral, iterative process of requesting and disclosin...
SOUPS
2006
ACM
14 years 3 months ago
2006
ACM
Unicode is becoming a dominant character representation format for information processing. This presents a very dangerous usability and security problem for many applications. The...