Sciweavers

5122 search results - page 366 / 1025
» Comparing Consequence Relations
Sort
View
ICML
2010
IEEE
15 years 7 months ago
On learning with kernels for unordered pairs
We propose and analyze two strategies to learn over unordered pairs with kernels, and provide a common theoretical framework to compare them. The strategies are related to methods...
Martial Hue, Jean-Philippe Vert
ICASSP
2010
IEEE
15 years 7 months ago
Approximate nearest neighbors using sparse representations
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
Joaquin Zepeda, Ewa Kijak, Christine Guillemot
AAMAS
2010
Springer
15 years 7 months ago
What the 2007 TAC Market Design Game tells us about effective auction mechanisms
This paper analyzes the entrants to the 2007 TAC Market Design Game. We present a classification of the entries to the competition, and use this classification to compare these ent...
Jinzhong Niu, Kai Cai, Simon Parsons, Peter McBurn...
IAJIT
2008
115views more  IAJIT 2008»
15 years 6 months ago
A Novel Mechanism to Improve Performance of TCP Protocol over Asymmetric Networks
: In this paper, TCP performance issues in bandwidth asymmetric networks are investigated. Related works to improve TCP performance in bandwidth asymmetric networks are introduced ...
Wissam Al-Khatib, K. Gunavathi
CLEIEJ
2006
87views more  CLEIEJ 2006»
15 years 6 months ago
Integrity Constraint Checking in Distributed Nested Transactions over a Database Cluster
This paper presents a solution to check referential integrity constraints and conjunctive global constraints in a relational multi database system. It also presents the experiment...
Stéphane Gançarski, Claudia Le&oacut...