Sciweavers

6202 search results - page 57 / 1241
» Without Loss of Generality
Sort
View
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
16 years 1 months ago
Deletion Without Rebalancing in Balanced Binary Trees
We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect delet...
Siddhartha Sen, Robert E. Tarjan
CISS
2008
IEEE
15 years 10 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
CALCO
2007
Springer
118views Mathematics» more  CALCO 2007»
15 years 10 months ago
Coalgebraic Epistemic Update Without Change of Model
Abstract. We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions an...
Corina Cîrstea, Mehrnoosh Sadrzadeh
SIGIR
2006
ACM
15 years 10 months ago
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
Oren Kurland, Lillian Lee
ICCV
2005
IEEE
15 years 10 months ago
Learning the Probability of Correspondences without Ground Truth
We present a quality assessment procedure for correspondence estimation based on geometric coherence rather than ground truth. The procedure can be used for performance evaluation...
Qingxiong Yang, R. Matt Steele, David Nisté...