Sciweavers

721 search results - page 96 / 145
» Almost universal graphs
Sort
View
OPODIS
2004
13 years 11 months ago
Self-optimizing DHTs Using Request Profiling
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
Alina Bejan, Sukumar Ghosh
BIRTHDAY
1991
Springer
14 years 1 months ago
The Markgraf Karl Refutation Procedure
The goal of the MKRP project is the development of a theorem prover which can be used as an inference engine in various applications, in particular it should be capable of proving ...
Hans Jürgen Ohlbach, Jörg H. Siekmann
CORR
2007
Springer
122views Education» more  CORR 2007»
13 years 10 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
CVPR
2009
IEEE
15 years 5 months ago
A Revisit of Generative Model for Automatic Image Annotation using Markov Random Fields
Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many we...
Yu Xiang (Fudan University), Xiangdong Zhou (Fudan...
ORL
1998
68views more  ORL 1998»
13 years 9 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick