Sciweavers

1536 search results - page 49 / 308
» Approximately Dominating Representatives
Sort
View
WADS
2007
Springer
184views Algorithms» more  WADS 2007»
14 years 4 months ago
A Pseudopolynomial Time O (log n )-Approximation Algorithm for Art Gallery Problems
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
ICIP
2005
IEEE
14 years 3 months ago
Multispectral loss-less compression using approximation methods
— The large size of multispectral data files is currently a major issue in multispectral imaging. The transmission of multispectral data over networks, as well as the storage of ...
Paolo Pellegri, Gianluca Novati, Raimondo Schettin...
CIDR
2003
134views Algorithms» more  CIDR 2003»
13 years 11 months ago
Approximate Range Selection Queries in Peer-to-Peer Systems
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...
Abhishek Gupta, Divyakant Agrawal, Amr El Abbadi
DSD
2010
IEEE
135views Hardware» more  DSD 2010»
13 years 10 months ago
An Approximate Maximum Common Subgraph Algorithm for Large Digital Circuits
—This paper presents an approximate Maximum Common Subgraph (MCS) algorithm, specifically for directed, cyclic graphs representing digital circuits. Because of the application d...
Jochem H. Rutgers, Pascal T. Wolkotte, Philip K. F...
INFORMATICASI
2007
89views more  INFORMATICASI 2007»
13 years 10 months ago
Approximate Representation of Textual Documents in the Concept Space
In this paper we deal with the problem of addition of new documents in collection when documents are represented in lower dimensional space by concept indexing. Concept indexing i...
Jasminka Dobsa, Bojana Dalbelo Basic