Sciweavers

5387 search results - page 127 / 1078
» Generating generic functions
Sort
View
TOOLS
1999
IEEE
15 years 7 months ago
Interaction Schemata: Compiling Interactions to Code
Programming object interactions is at the heart of object-oriented programming. To improve reusability of the interactions, it is important to program object interactions generica...
Neeraj Sangal, Edward Farrell, Karl J. Lieberherr,...
JSYML
2008
72views more  JSYML 2008»
15 years 2 months ago
Perfect trees and elementary embeddings
An important technique in large cardinal set theory is that of extending an elementary embedding j : M N between inner models to an elementary embedding j : M[G] N[G] between ge...
Sy-David Friedman, Katherine Thompson
INFORMATICALT
2002
140views more  INFORMATICALT 2002»
15 years 2 months ago
Intelligent Initial Finite Element Mesh Generation for Solutions of 2D Problems
The new strategy for non-uniform initial FE mesh generation is presented in this paper. The main focus is set to a priori procedures that define the sizing function independent on ...
Lina Vasiliauskiene, Romualdas Bausys
COMBINATORICS
1998
88views more  COMBINATORICS 1998»
15 years 2 months ago
Multi-statistic enumeration of two-stack sortable permutations
Using Zeilberger’s factorization of two-stack-sortable permutations, we write a functional equation — of a strange sort — that defines their generating function according t...
Mireille Bousquet-Mélou
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 10 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...