Sciweavers

1379 search results - page 167 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
ICIP
1997
IEEE
16 years 8 months ago
Two-Dimensional Blind Deconvolution Using a Robust GCD Approach
In this paper we examine the applicability of the previously proposed Greatest Common Divisor (GCD) method to blind image deconvolution. In this method, the desired image is appro...
S. U. Pillai, B. Liang
ICDE
2006
IEEE
149views Database» more  ICDE 2006»
16 years 7 months ago
An Efficient XPath Query Processor for XML Streams
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...
Yi Chen, Susan B. Davidson, Yifeng Zheng
ICML
2008
IEEE
16 years 7 months ago
An object-oriented representation for efficient reinforcement learning
Rich representations in reinforcement learning have been studied for the purpose of enabling generalization and making learning feasible in large state spaces. We introduce Object...
Carlos Diuk, Andre Cohen, Michael L. Littman
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 6 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
NCA
2009
IEEE
16 years 1 months ago
A Distributed Algorithm for Web Content Replication
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
Sharrukh Zaman, Daniel Grosu