Sciweavers

15073 search results - page 255 / 3015
» Probabilistic algorithms for computing resultants
Sort
View
ECCV
1998
Springer
16 years 6 months ago
Perceptual Smoothing and Segmentation of Colour Textures
An approach for perceptual segmentation of colour image textures is described. A multiscale representation of the texture image, generated by a multiband smoothing algorithm based ...
Maria Petrou, Majid Mirmehdi, M. Coors
IJRR
2010
132views more  IJRR 2010»
15 years 1 months ago
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
Advances in the direct computation of Lyapunov functions using convex optimization make it possible to efficiently evaluate regions of attraction for smooth nonlinear systems. Her...
Russ Tedrake, Ian R. Manchester, Mark Tobenkin, Jo...
JMLR
2010
102views more  JMLR 2010»
14 years 11 months ago
Efficient Algorithms for Conditional Independence Inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI) implications by an algebraic method of structural imsets. The basic idea is to transfor...
Remco R. Bouckaert, Raymond Hemmecke, Silvia Lindn...
CCGRID
2004
IEEE
15 years 8 months ago
Adaptive congestion control for hotspot management in structured peer-to-peer systems
Distributed Hash Tables (DHTs) bring the promise of increased availability of data to wide-area systems, under the assumption of uniform request load. However, they don't int...
Anne-Marie Bosneag, Yong Xi, Xinjie Li, Monica Bro...
ALGORITHMICA
2004
112views more  ALGORITHMICA 2004»
15 years 4 months ago
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Abstract. We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. LexBFS, a seminal algorithm for recognizing chordal graphs, was the genesis for ...
Anne Berry, Jean R. S. Blair, Pinar Heggernes, Bar...