Sciweavers

2324 search results - page 354 / 465
» A Fast Keyword-Spotting Technique
Sort
View
SSD
2007
Springer
124views Database» more  SSD 2007»
16 years 16 days ago
Querying Objects Modeled by Arbitrary Probability Distributions
In many modern applications such as biometric identification systems, sensor networks, medical imaging, geology, and multimedia databases, the data objects are not described exact...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
16 years 16 days ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
CGO
2006
IEEE
16 years 15 days ago
Tailoring Graph-coloring Register Allocation For Runtime Compilation
Just-in-time compilers are invoked during application execution and therefore need to ensure fast compilation times. Consequently, runtime compiler designers are averse to impleme...
Keith D. Cooper, Anshuman Dasgupta
DATE
2006
IEEE
78views Hardware» more  DATE 2006»
16 years 15 days ago
STAX: statistical crosstalk target set compaction
This paper presents STAX, a crosstalk target set compaction framework to reduce the complexity of the crosstalk ATPG process by pruning non-fault-producing targets. In general, ex...
Shahin Nazarian, Massoud Pedram, Sandeep K. Gupta,...
GLOBECOM
2006
IEEE
16 years 14 days ago
FEAT: Improving Accuracy in End-to-end Available Bandwidth Measurement
—This report describes our ongoing work on a new end-to-end available-bandwidth measurement tool: FEAT (Fish-Eye Availablebandwidth Tool). FEAT features a new dynamic pattern of ...
Qiang Wang, Liang Cheng