Sciweavers

267 search results - page 48 / 54
» Solving Relational Similarity Problems Using the Web as a Co...
Sort
View
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 8 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
DLOG
2004
13 years 9 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
CVPR
2008
IEEE
14 years 9 months ago
Matching images under unstable segmentations
Region based features are getting popular due to their higher descriptive power relative to other features. However, real world images exhibit changes in image segments capturing ...
Varsha Hedau, Himanshu Arora, Narendra Ahuja
CDC
2010
IEEE
136views Control Systems» more  CDC 2010»
13 years 2 months ago
A distributed Newton method for Network Utility Maximization
Most existing work uses dual decomposition and subgradient methods to solve Network Utility Maximization (NUM) problems in a distributed manner, which suffer from slow rate of con...
Ermin Wei, Asuman E. Ozdaglar, Ali Jadbabaie
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
14 years 1 days ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder