Sciweavers

1017 search results - page 174 / 204
» Some existence and construction results of polygonal designs
Sort
View
CL
2008
Springer
13 years 7 months ago
Efficient exception handling in Java bytecode-to-C ahead-of-time compiler for embedded systems
One of the most promising approaches to Java acceleration in embedded systems is a bytecode-to-C ahead-of-time compiler (AOTC). It improves the performance of a Java virtual machi...
Dong-Heon Jung, Jong Kuk Park, Sung-Hwan Bae, Jaem...
MOBIHOC
2010
ACM
13 years 5 months ago
Barrier coverage with sensors of limited mobility
Barrier coverage is a critical issue in wireless sensor networks for various battlefield and homeland security applications. The goal is to effectively detect intruders that attem...
Anwar Saipulla, Benyuan Liu, Guoliang Xing, Xinwen...
SIGIR
2011
ACM
12 years 10 months ago
Learning search tasks in queries and web pages via graph regularization
As the Internet grows explosively, search engines play a more and more important role for users in effectively accessing online information. Recently, it has been recognized that ...
Ming Ji, Jun Yan, Siyu Gu, Jiawei Han, Xiaofei He,...
INFOCOM
2012
IEEE
11 years 9 months ago
CONSEL: Connectivity-based segmentation in large-scale 2D/3D sensor networks
—A cardinal prerequisite for the system design of a sensor network, is to understand the geometric environment where sensor nodes are deployed. The global topology of a largescal...
Hongbo Jiang, Tianlong Yu, Chen Tian, Guang Tan, C...
STOC
2010
ACM
170views Algorithms» more  STOC 2010»
13 years 11 months ago
Connectivity oracles for failure prone graphs
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Ran Duan, Seth Pettie