Sciweavers

526 search results - page 73 / 106
» Increments of Random Partitions
Sort
View
ASPDAC
2009
ACM
161views Hardware» more  ASPDAC 2009»
14 years 3 months ago
Risk aversion min-period retiming under process variations
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
Jia Wang, Hai Zhou
GLOBECOM
2007
IEEE
14 years 2 months ago
A New Design of Bloom Filter for Packet Inspection Speedup
— Bloom filter is a space-efficient randomized data structure for group membership query. It is widely used in networking applications which involve the packet header/content i...
Yang Chen, Abhishek Kumar, Jun Xu
MDM
2007
Springer
14 years 2 months ago
Near Optimal Update-Broadcast of Data Sets
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg
ICRA
2006
IEEE
183views Robotics» more  ICRA 2006»
14 years 2 months ago
Anytime Dynamic Path-planning with Flexible Probabilistic Roadmaps
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...
Khaled Belghith, Froduald Kabanza, Leo Hartman, Ro...
PKDD
2005
Springer
161views Data Mining» more  PKDD 2005»
14 years 1 months ago
Active Sampling for Knowledge Discovery from Biomedical Data
Abstract. We describe work aimed at cost-constrained knowledge discovery in the biomedical domain. To improve the diagnostic/prognostic models of cancer, new biomarkers are studied...
Sriharsha Veeramachaneni, Francesca Demichelis, Em...