105 search results - page 5 / 21 » A Fast Algorithm for Moving Interface Problems |
171
click to vote
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
75
Voted
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
— The aggregate capacity of wireless ad-hoc networks can be substantially increased if each wireless node is equipped with multiple network interface cards (NICs) and each NIC op...
CC
2004
Springer
15 years 3 months ago
2004
Springer
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically efficient for typical grammars, and can parse with an...
AVSS
2006
IEEE
2006
IEEE
"Hybrid Cone-Cylinder" Codebook Model for Foreground Detection with Shadow and Highlight Suppression
15 years 3 months ago
In the interest of 24-7 long-term surveillance, a truly robust, adaptive, and fast background-foreground segmentation technique is required. This paper deals with the especially d...
109
click to vote
IMCSIT
2010
14 years 7 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...