Sciweavers

5210 search results - page 170 / 1042
» Exact geometric computation
Sort
View
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
16 years 6 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
COCOON
2005
Springer
15 years 10 months ago
A PTAS for a Disc Covering Problem Using Width-Bounded Separators
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
Zhixiang Chen, Bin Fu, Yong Tang, Binhai Zhu
130
Voted
CNSR
2006
IEEE
15 years 11 months ago
Trusted Computing for Protecting Ad-hoc Routing
Ad-hoc networks rely on participation and cooperation of nodes within the network to transmit data to destinations. However, in networks where participating nodes are controlled b...
Michael Jarrett, Paul Ward
ASPDAC
2006
ACM
127views Hardware» more  ASPDAC 2006»
15 years 11 months ago
Memory size computation for multimedia processing applications
– In real-time multimedia processing systems a very large part of the power consumption is due to the data storage and data transfer. Moreover, the area cost is often largely dom...
Hongwei Zhu, Ilie I. Luican, Florin Balasa
AIPS
2004
15 years 6 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola