Sciweavers

2658 search results - page 70 / 532
» On efficient balanced codes
Sort
View
ICDCS
2009
IEEE
13 years 7 months ago
Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases
The balance between privacy and utility is a classical problem with an increasing impact on the design of modern information systems. On the one side it is crucial to ensure that ...
Valentina Ciriani, Sabrina De Capitani di Vimercat...
NIPS
2008
13 years 10 months ago
On the Efficient Minimization of Classification Calibrated Surrogates
Bartlett et al (2006) recently proved that a ground condition for convex surrogates, classification calibration, ties up the minimization of the surrogates and classification risk...
Richard Nock, Frank Nielsen
IJCAI
2003
13 years 10 months ago
Increasing Dialogue Efficiency in Case-Based Reasoning Without Loss of Solution Quality
Increasing dialogue efficiency in case-based reasoning (CBR) must be balanced against the risk of commitment to a sub-optimal solution. Focusing on incremental query elicitation i...
David McSherry
DCC
2004
IEEE
14 years 8 months ago
Length-Limited Variable-to-Variable Length Codes For High-Performance Entropy Coding
Arithmetic coding achieves a superior coding rate when encoding a binary source, but its lack of speed makes it an inferior choice when true high? performance encoding is needed. ...
Joshua G. Senecal, Mark A. Duchaineau, Kenneth I. ...
AAIM
2007
Springer
123views Algorithms» more  AAIM 2007»
14 years 1 months ago
Efficient Algorithms for k -Disjoint Paths Problems on DAGs
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
Rudolf Fleischer, Qi Ge, Jian Li, Hong Zhu