11397 search results - page 112 / 2280 » A Relational Abstraction for Functions |
178
click to vote
UC
2009
Springer
16 years 1 months ago
2009
Springer
Geometrical Computation and Computable Analysis J´erˆome Durand-Lose⋆ Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P. 6759, F-45067 OR...
199
click to vote
CACM
1999
15 years 6 months ago
1999
ion suffices ("decide which type you want and provide a full set of operations for each type"). If the application domain is, say, the administration of a university, the...
237
click to vote
SIGIR
2002
ACM
15 years 6 months ago
2002
ACM
tion Abstract ChengXiang Zhai (Advisor: John Lafferty) Language Technologies Institute School of Computer Science Carnegie Mellon University With the dramatic increase in online in...
203
click to vote
MFCS
1995
Springer
15 years 10 months ago
1995
Springer
act Account of Composition Mart n Abadi1 and Stephan Merz2 1 Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, U.S.A. 2 Institut fur I...
193
click to vote
LFCS
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...