Sciweavers

2814 search results - page 110 / 563
» Competitive Analysis of Distributed Algorithms
Sort
View
CVPR
2012
IEEE
13 years 4 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
135
Voted
BMCBI
2006
126views more  BMCBI 2006»
15 years 2 months ago
A Regression-based K nearest neighbor algorithm for gene function prediction from heterogeneous data
Background: As a variety of functional genomic and proteomic techniques become available, there is an increasing need for functional analysis methodologies that integrate heteroge...
Zizhen Yao, Walter L. Ruzzo
IPPS
2000
IEEE
15 years 6 months ago
Optimal on Demand Packet Scheduling in Single-Hop Multichannel Communication Systems
In this paper, we study the problem of on demand minimum length packet scheduling in single-hop multichannel systems. Examples of these systems are those centered around switching...
Maurizio A. Bonuccelli, Susanna Pelagatti
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
15 years 8 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
PODC
2010
ACM
15 years 4 months ago
Distributed data classification in sensor networks
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
Ittay Eyal, Idit Keidar, Raphael Rom