Sciweavers

5022 search results - page 298 / 1005
» Data structures and problem solving using Java
Sort
View
PODS
2003
ACM
143views Database» more  PODS 2003»
16 years 3 months ago
Maintaining variance and k-medians over data stream windows
The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are ...
Brian Babcock, Mayur Datar, Rajeev Motwani, Liadan...
ICCSA
2007
Springer
15 years 9 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
16 years 4 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
CSCLP
2007
Springer
15 years 9 months ago
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
Pavel Surynek
COLING
2000
15 years 4 months ago
Japanese Case Structure Analysis
In Japanese, case structure analysis is very important to handle several troublesome characteristics of Japanese such as scrambling, omission of case components, and disappearance...
Daisuke Kawahara, Nobuhiro Kaji, Sadao Kurohashi