Sciweavers

359 search results - page 40 / 72
» Online Algorithms for Disk Graphs
Sort
View
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
15 years 6 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall
SIGCOMM
2010
ACM
14 years 12 months ago
Unbiased sampling in directed social graph
Microblogging services, such as Twitter, are among the most important online social networks(OSNs). Different from OSNs such as Facebook, the topology of microblogging service is ...
Tianyi Wang, Yang Chen, Zengbin Zhang, Peng Sun, B...
AIME
2009
Springer
15 years 6 months ago
Segmentation of Text and Non-text in On-Line Handwritten Patient Record Based on Spatio-Temporal Analysis
Note taking is a common way for physicians to collect information from their patients in medical inquiries and diagnoses. Many times, when describing the pathology in medical recor...
Rattapoom Waranusast, Peter Haddawy, Matthew N. Da...
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 10 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
JMLR
2008
159views more  JMLR 2008»
14 years 11 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin