Sciweavers

1099 search results - page 142 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
ICCV
2007
IEEE
16 years 2 days ago
Learning Multiscale Representations of Natural Scenes Using Dirichlet Processes
We develop nonparametric Bayesian models for multiscale representations of images depicting natural scene categories. Individual features or wavelet coefficients are marginally de...
Jyri J. Kivinen, Erik B. Sudderth, Michael I. Jord...
EDBT
2004
ACM
172views Database» more  EDBT 2004»
15 years 10 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
88
Voted
FOCS
2005
IEEE
15 years 3 months ago
Towards a Final Analysis of Pairing Heaps
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
Seth Pettie
JIRS
2008
100views more  JIRS 2008»
14 years 10 months ago
Model-based Predictive Control of Hybrid Systems: A Probabilistic Neural-network Approach to Real-time Control
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...
Bostjan Potocnik, Gasper Music, Igor Skrjanc, Boru...