Sciweavers

8824 search results - page 1600 / 1765
» On the Complexity of Real Functions
Sort
View
ECOOP
1999
Springer
15 years 10 months ago
Foundations for Virtual Types
Virtual types have been proposed as a notation for generic programming in object-oriented languages—an alternative to the more familiar mechanism of parametric classes. The trade...
Atsushi Igarashi, Benjamin C. Pierce
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
15 years 10 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
TSD
1999
Springer
15 years 10 months ago
Prague Dependency Treebank: Restoration of Deletions
The use of the treebank as a resource for linguistic research has led us to look for an annotation scheme representing not only surface syntactic information (in ‘analytic trees...
Eva Hajicová, Ivana Kruijff-Korbayová...
ECBS
1996
IEEE
127views Hardware» more  ECBS 1996»
15 years 10 months ago
Domain Engineering: The Challenge, Status, and Trends
Naval Surface Warfare Center Dahlgren Division; under joint sponsorship of the Office of Naval Research; the Naval Command, Control, and Ocean Surveillance Center; and the Naval S...
Stephanie White, Michael Edwards
ICALP
1993
Springer
15 years 10 months ago
Exact Asymptotics of Divide-and-Conquer Recurrences
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...
Philippe Flajolet, Mordecai J. Golin
« Prev « First page 1600 / 1765 Last » Next »