Sciweavers

189 search results - page 5 / 38
» Efficient Representation of Adhoc Constraints
Sort
View
NIPS
1990
13 years 11 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
ICDE
2009
IEEE
121views Database» more  ICDE 2009»
14 years 11 months ago
Large-Scale Deduplication with Constraints Using Dedupalog
We present a declarative framework for collective deduplication of entity references in the presence of constraints. Constraints occur naturally in many data cleaning domains and c...
Arvind Arasu, Christopher Ré, Dan Suciu
CONEXT
2009
ACM
13 years 10 months ago
ThunderDome: discovering upload constraints using decentralized bandwidth tournaments
ThunderDome is a system for collaboratively measuring upload bandwidths in ad-hoc peer-to-peer systems. It works by scheduling bandwidth probes between pairs of hosts, wherein eac...
John R. Douceur, James W. Mickens, Thomas Moscibro...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 9 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin
CVPR
2010
IEEE
14 years 6 months ago
Aggregating local descriptors into a compact image representation
We address the problem of image search on a very large scale, where three constraints have to be considered jointly: the accuracy of the search, its efficiency, and the memory usag...
Hervé Jégou, Matthijs Douze, Cordelia Schmid and...