Sciweavers

1494 search results - page 246 / 299
» Polynomial time algorithms for network information flow
Sort
View
FOCS
2004
IEEE
14 years 14 days ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
NIPS
2008
13 years 10 months ago
Recursive Segmentation and Recognition Templates for 2D Parsing
Language and image understanding are two major goals of artificial intelligence which can both be conceptually formulated in terms of parsing the input signal into a hierarchical ...
Leo Zhu, Yuanhao Chen, Yuan Lin, Chenxi Lin, Alan ...
MOBIHOC
2006
ACM
14 years 8 months ago
Modeling steady-state and transient behaviors of user mobility: : formulation, analysis, and application
Recent studies on mobility modeling have focused on characterizing user mobility from real traces of wireless LANs (WLANs) and creating mobility models based on such characterizat...
Jong-Kwon Lee, Jennifer C. Hou
DSN
2004
IEEE
14 years 14 days ago
Verifying Web Applications Using Bounded Model Checking
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
Yao-Wen Huang, Fang Yu, Christian Hang, Chung-Hung...
WSNA
2003
ACM
14 years 2 months ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li