Sciweavers

920 search results - page 122 / 184
» Generating Satisfiable Problem Instances
Sort
View
126
Voted
CIDR
2009
102views Algorithms» more  CIDR 2009»
15 years 3 months ago
Why Did My Query Slow Down
Enterprise environments have isolated teams responsible separately for database management and the management of underlying networkattached server-storage infrastructure (referred...
Nedyalko Borisov, Sandeep Uttamchandani, Ramani Ro...
FUIN
2006
105views more  FUIN 2006»
15 years 2 months ago
Spiking Neural P Systems
This paper is an attempt to incorporate the idea of spiking neurons into the area of membrane computing, and to this aim we introduce a class of neural-like P systems which we cal...
Mihai Ionescu, Gheorghe Paun, Takashi Yokomori
JMLR
2006
112views more  JMLR 2006»
15 years 2 months ago
Kernels on Prolog Proof Trees: Statistical Learning in the ILP Setting
We develop kernels for measuring the similarity between relational instances using background knowledge expressed in first-order logic. The method allows us to bridge the gap betw...
Andrea Passerini, Paolo Frasconi, Luc De Raedt
124
Voted
MP
2010
116views more  MP 2010»
15 years 1 months ago
Separation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
Konstantinos Kaparis, Adam N. Letchford
144
Voted
WWW
2008
ACM
16 years 3 months ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...