Sciweavers

518 search results - page 64 / 104
» Beating a Random Assignment
Sort
View
139
Voted
CVPR
2012
IEEE
13 years 5 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
PODS
2006
ACM
156views Database» more  PODS 2006»
16 years 2 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
COMPGEOM
2010
ACM
15 years 7 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
IQ
2007
15 years 4 months ago
In Search Of An Accuracy Metric
Practitioners and researchers often refer to error rates or accuracy percentages of databases. The former is the number of cells in error divided by the total number of cells; the...
Craig W. Fisher, Eitel J. M. Lauría, Caroly...
142
Voted
JACM
2000
73views more  JACM 2000»
15 years 2 months ago
Parallel RAMs with owned global memory and deterministic context-free language recognition
We identify and study a natural and frequently occurring subclass of Concurrent Read, Exclusive Write Parallel Random Access Machines (CREW-PRAMs). Called Concurrent Read, Owner Wr...
Patrick W. Dymond, Walter L. Ruzzo