Sciweavers

284 search results - page 44 / 57
» On the adaptable chromatic number of graphs
Sort
View
SSDBM
2010
IEEE
142views Database» more  SSDBM 2010»
13 years 5 months ago
Efficient and Adaptive Distributed Skyline Computation
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
George Valkanas, Apostolos N. Papadopoulos
ICCV
2011
IEEE
12 years 7 months ago
Learning Spatiotemporal Graphs of Human Activities
Complex human activities occurring in videos can be defined in terms of temporal configurations of primitive actions. Prior work typically hand-picks the primitives, their total...
William Brendel, Sinisa Todorovic
EMMCVPR
2005
Springer
14 years 27 days ago
Linear Programming Matching and Appearance-Adaptive Object Tracking
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
Hao Jiang, Mark S. Drew, Ze-Nian Li
COCOON
2003
Springer
14 years 18 days ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
PODC
2009
ACM
14 years 8 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...