Sciweavers

2745 search results - page 162 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
143
Voted
DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
15 years 9 months ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
DSRT
2008
IEEE
15 years 5 months ago
Evaluating Large Scale Distributed Simulation of P2P Networks
P2P systems have witnessed phenomenal development in recent years. Evaluating and analyzing new and existing algorithms and techniques is a key issue for developers of P2P systems...
Tien Tuan Anh Dinh, Georgios K. Theodoropoulos, Ro...
CAV
2006
Springer
141views Hardware» more  CAV 2006»
15 years 7 months ago
SMT Techniques for Fast Predicate Abstraction
niques for Fast Predicate Abstraction Shuvendu K. Lahiri , Robert Nieuwenhuis , and Albert Oliveras Abstract. Predicate abstraction is a technique for automatically exfinite-state ...
Shuvendu K. Lahiri, Robert Nieuwenhuis, Albert Oli...
ICDE
2005
IEEE
156views Database» more  ICDE 2005»
16 years 5 months ago
Reverse Nearest Neighbors in Large Graphs
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
Man Lung Yiu, Dimitris Papadias, Nikos Mamoulis, Y...
SFM
2007
Springer
15 years 10 months ago
Tackling Large State Spaces in Performance Modelling
Stochastic performance models provide a powerful way of capturing and analysing the behaviour of complex concurrent systems. Traditionally, performance measures for these models ar...
William J. Knottenbelt, Jeremy T. Bradley