Sciweavers

2542 search results - page 451 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
ECCV
2006
Springer
14 years 10 months ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother
WWW
2007
ACM
14 years 9 months ago
A high-performance interpretive approach to schema-directed parsing
XML delivers key advantages in interoperability due to its flexibility, expressiveness, and platform-neutrality. As XML has become a performance-critical aspect of the next genera...
Morris Matsa, Eric Perkins, Abraham Heifets, Marga...
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
14 years 9 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
ICDCS
2007
IEEE
14 years 3 months ago
Stabilizing Peer-to-Peer Spatial Filters
In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information...
Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, M...
SEMWEB
2007
Springer
14 years 3 months ago
Change Paths in Reasoning!
Millions of research funding has been put down to develop - what I call - old forms - of reasoning that are characterized by strong focus on theoretical properties and strict adher...
Raphael Volz