Sciweavers

99 search results - page 8 / 20
» RNC Algorithms for the Uniform Generation of Combinatorial S...
Sort
View
AAAI
1998
13 years 8 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
TOG
2008
143views more  TOG 2008»
13 years 7 months ago
Discovering structural regularity in 3D geometry
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...
EACL
2006
ACL Anthology
13 years 9 months ago
Inheritance and the CCG Lexicon
I propose a uniform approach to the elimination of redundancy in CCG lexicons, where grammars incorporate inheritance hierarchies of lexical types, defined over a simple, feature-...
Mark McConville
ML
2011
ACM
308views Machine Learning» more  ML 2011»
13 years 2 months ago
Relational information gain
Abstract. Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities...
Marco Lippi, Manfred Jaeger, Paolo Frasconi, Andre...
WWW
2011
ACM
13 years 2 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg