Sciweavers

608 search results - page 100 / 122
» Random Systems with Complete Connections
Sort
View
ECCV
2010
Springer
14 years 2 months ago
SuperParsing: Scalable Nonparametric Image Parsing with Superpixels
This paper presents a simple and effective nonparametric approach to the problem of image parsing, or labeling image regions (in our case, superpixels produced by bottom-up segmen...
SIGMOD
2000
ACM
141views Database» more  SIGMOD 2000»
14 years 2 months ago
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer
Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects oft...
Florian Waas, César A. Galindo-Legaria
CRYPTO
1999
Springer
109views Cryptology» more  CRYPTO 1999»
14 years 1 months ago
Coding Constructions for Blacklisting Problems without Computational Assumptions
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
Ravi Kumar, Sridhar Rajagopalan, Amit Sahai
GLOBECOM
2009
IEEE
14 years 1 months ago
Experimental Validation of Periodic Codes for PON Monitoring
In this paper we investigate both experimentally and via simulation the monitoring of fiber link quality in a PON using optical coding technology. We use a new, simple and costeffe...
Mohammad M. Rad, Habib Fathallah, Sophie LaRochell...
ATAL
2008
Springer
13 years 11 months ago
Learning task-specific trust decisions
We study the problem of agents locating other agents that are both capable and willing to help complete assigned tasks. An agent incurs a fixed cost for each help request it sends...
Ikpeme Erete, Erin Ferguson, Sandip Sen