Sciweavers

7150 search results - page 1359 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
111
Voted
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 4 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
111
Voted
DSN
2007
IEEE
15 years 4 months ago
Bounding Peer-to-Peer Upload Traffic in Client Networks
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...
Chun-Ying Huang, Chin-Laung Lei
EDBT
2009
ACM
134views Database» more  EDBT 2009»
15 years 4 months ago
Caching content-based queries for robust and efficient image retrieval
In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and efficiency iss...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
114
Voted
CAV
2006
Springer
165views Hardware» more  CAV 2006»
15 years 4 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
107
Voted
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 4 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
« Prev « First page 1359 / 1430 Last » Next »