Sciweavers

86 search results - page 17 / 18
» Polytope-based computation of polynomial ranges
Sort
View
ICCV
1999
IEEE
14 years 10 months ago
United Snakes
Since their debut in 1987, snakes (active contour models) have become a standard image analysis technique with several variants now in common use. We present a framework called ``...
Jianming Liang, Tim McInerney, Demetri Terzopoulos
MOBIHOC
2008
ACM
14 years 8 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
ATAL
2009
Springer
14 years 3 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
14 years 1 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
PODS
2008
ACM
109views Database» more  PODS 2008»
14 years 8 months ago
Time-decaying aggregates in out-of-order streams
Processing large data streams is now a major topic in data management. The data involved can be truly massive, and the required analyses complex. In a stream of sequential events ...
Graham Cormode, Flip Korn, Srikanta Tirthapura