Sciweavers

556 search results - page 15 / 112
» A Comparative Study of Some Generalized Rough Approximations
Sort
View
IMC
2010
ACM
14 years 9 months ago
Comparing DNS resolvers in the wild
The Domain Name System (DNS) is a fundamental building block of the Internet. Today, the performance of more and more applications depend not only on the responsiveness of DNS, bu...
Bernhard Ager, Wolfgang Mühlbauer, Georgios S...
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 3 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
JMLR
2006
125views more  JMLR 2006»
14 years 11 months ago
Linear Programming Relaxations and Belief Propagation - An Empirical Study
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
Chen Yanover, Talya Meltzer, Yair Weiss
ECCV
2004
Springer
16 years 23 days ago
Evaluation of Robust Fitting Based Detection
Low-level image processing algorithms generally provide noisy features that are far from being Gaussian. Medium-level tasks such as object detection must therefore be robust to out...
Sio-Song Ieng, Jean-Philippe Tarel, Pierre Charbon...
PODC
2006
ACM
15 years 5 months ago
Object location using path separators
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
Ittai Abraham, Cyril Gavoille