Sciweavers

909 search results - page 121 / 182
» Relational bytecode correlations
Sort
View
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 3 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
ROBIO
2006
IEEE
172views Robotics» more  ROBIO 2006»
15 years 3 months ago
Robust 3D Robotic Sound Localization Using State-Space HRTF Inversion
Abstract— We address the problem of robotic real-time binaural hearing using a humanoid head. The sound detection ability for a previously proposed robotic 3D binaural sound loca...
Fakheredine Keyrouz, Klaus Diepold, Patrick Dewild...
RTAS
2006
IEEE
15 years 3 months ago
On Non-Utilization Bounds for Arbitrary Fixed Priority Policies
Prior research on schedulability bounds focused primarily on bounding utilization as a means to meet deadline constraints. Non-trivial bounds were found for a handful of schedulin...
Xue Liu, Tarek F. Abdelzaher
ASPDAC
2006
ACM
91views Hardware» more  ASPDAC 2006»
15 years 3 months ago
Fast substrate noise-aware floorplanning with preference directed graph for mixed-signal SOCs
— In this paper, we introduce a novel substrate noise estimation technique during early floorplanning, based on the concept of Block Preference Directed Graph (BPDG) and the cla...
Minsik Cho, Hongjoong Shin, David Z. Pan
CLEANDB
2006
ACM
185views Database» more  CLEANDB 2006»
15 years 3 months ago
In-network Outlier Cleaning for Data Collection in Sensor Networks
Outliers are very common in the environmental data monitored by a sensor network consisting of many inexpensive, low fidelity, and frequently failed sensors. The limited battery ...
Yongzhen Zhuang, Lei Chen 0002