Sciweavers

10051 search results - page 1477 / 2011
» A Dynamic Separator Algorithm
Sort
View
CIKM
2009
Springer
16 years 1 months ago
Pure spreading activation is pointless
Almost every application of spreading activation is accompanied by its own set of often heuristic restrictions on the dynamics. We show that in constraint-free scenarios spreading...
Michael R. Berthold, Ulrik Brandes, Tobias Kö...
DEXA
2009
Springer
151views Database» more  DEXA 2009»
16 years 1 months ago
Detecting Projected Outliers in High-Dimensional Data Streams
Abstract. In this paper, we study the problem of projected outlier detection in high dimensional data streams and propose a new technique, called Stream Projected Ouliter deTector ...
Ji Zhang, Qigang Gao, Hai H. Wang, Qing Liu, Kai X...
166
Voted
ISVC
2009
Springer
16 years 29 days ago
Optical Flow Computation from an Asynchronised Multiresolution Image Sequence
We develop a method for the optical flow computation from a zooming image sequence. The synchronisation of image resolution for a pair of successive images in an image sequence is...
Yusuke Kameda, Naoya Ohnishi, Atsushi Imiya, Tomoy...
LPNMR
2009
Springer
16 years 29 days ago
Belief Revision with Bounded Treewidth
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
Reinhard Pichler, Stefan Rümmele, Stefan Wolt...
MFCS
2009
Springer
16 years 29 days ago
The Longest Path Problem Is Polynomial on Interval Graphs
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
Kyriaki Ioannidou, George B. Mertzios, Stavros D. ...
« Prev « First page 1477 / 2011 Last » Next »