Sciweavers

25041 search results - page 4278 / 5009
» Algorithms for Clustering Data
Sort
View
ICC
2009
IEEE
127views Communications» more  ICC 2009»
15 years 5 months ago
Starburst SSD: An Efficient Protocol for Selective Dissemination
Abstract--We present Starburst, a routing-based protocol designed to efficiently disseminate data items to small subsets within a sensor network. Starburst constructs a routing hie...
Tahir Azim, Qasim Mansoor, Philip Levis
ICMCS
2009
IEEE
102views Multimedia» more  ICMCS 2009»
15 years 5 months ago
Scalable HMM based inference engine in large vocabulary continuous speech recognition
Parallel scalability allows an application to efficiently utilize an increasing number of processing elements. In this paper we explore a design space for parallel scalability for...
Jike Chong, Kisun You, Youngmin Yi, Ekaterina Goni...
ICRA
2009
IEEE
126views Robotics» more  ICRA 2009»
15 years 5 months ago
Time-bounded lattice for efficient planning in dynamic environments
For vehicles navigating initially unknown cluttered environments, current state-of-the-art planning algorithms are able to plan and re-plan dynamically-feasible paths efficiently a...
Aleksandr Kushleyev, Maxim Likhachev
DASFAA
2011
IEEE
341views Database» more  DASFAA 2011»
15 years 5 months ago
Utility-Oriented K-Anonymization on Social Networks
\Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in n...
Yazhe WANG, Long XIE, Baihua ZHENG, and Ken C. K. ...
GLOBECOM
2010
IEEE
15 years 4 months ago
Circulant-Graph-Based Fault-Tolerant Routing for All-Optical WDM LANs
High demands in data delivery latency and communication reliability encourage the use of fault-toleranceenhanced all-optical WDM networks. Low latency is satisfied by setting up a ...
Dexiang Wang, Janise McNair
« Prev « First page 4278 / 5009 Last » Next »