5592 search results - page 1027 / 1119 » On Random Betweenness Constraints |
140
click to vote
HVEI
2010
15 years 6 months ago
2010
An objective quality estimator for either still images or video should accurately estimate the perceived quality scores of a collection of stimuli. New applications and processing...
170
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
153
click to vote
NIPS
2008
15 years 6 months ago
2008
Abstract: Structure learning of dynamic Bayesian networks provide a principled mechanism for identifying conditional dependencies in time-series data. This learning procedure assum...
151
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
120
Voted
OPODIS
2007
15 years 6 months ago
2007
Consider the following game between a worm and an alert3 over a network of n nodes. Initially, no nodes are infected or alerted and each node in the network is a special detector n...