Sciweavers

3889 search results - page 195 / 778
» A Framework for Optimizing Paper Matching
Sort
View
129
Voted
CAAN
2006
Springer
15 years 7 months ago
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
Fredrik Manne, Qin Xin
INFOCOM
2000
IEEE
15 years 8 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
123
Voted
CVPR
2005
IEEE
16 years 5 months ago
Locally Adaptive Support-Weight Approach for Visual Correspondence Search
In this paper, we present a new area-based method for visual correspondence search that focuses on the dissimilarity computation. Local and area-based matching methods generally m...
Kuk-Jin Yoon, In-So Kweon
127
Voted
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
16 years 3 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
TCAD
1998
126views more  TCAD 1998»
15 years 3 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli