Sciweavers

311 search results - page 33 / 63
» Online Construction of Dynamic Object Process Graphs
Sort
View
AAAI
2012
11 years 11 months ago
Dynamic Matching via Weighted Myopia with Application to Kidney Exchange
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
John P. Dickerson, Ariel D. Procaccia, Tuomas Sand...
ICCV
2003
IEEE
14 years 11 months ago
Joint Region Tracking with Switching Hypothesized Measurements
This paper proposes a switching hypothesized measurements (SHM) model supporting multimodal probability distributions and presents the application of the model in handling potenti...
Kia-Fock Loe, Tele Tan, Yang Wang 0002
WAC
2005
Springer
118views Communications» more  WAC 2005»
14 years 2 months ago
Towards a Reliable, Wide-Area Infrastructure for Context-Based Self-management of Communications
Abstract. In this paper we describe ConStruct, a distributed, contextaggregation based service infrastructure which supports the development of context-aware applications. ConStruc...
Graeme Stevenson, Paddy Nixon, Simon A. Dobson
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
14 years 1 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie
PR
2007
107views more  PR 2007»
13 years 8 months ago
Newtonian clustering: An approach based on molecular dynamics and global optimization
Given a data set, a dynamical procedure is applied to the data points in order to shrink and separate, possibly overlapping clusters. Namely, Newton’s equations of motion are em...
Konstantinos Blekas, Isaac E. Lagaris