Sciweavers

2080 search results - page 171 / 416
» Measuring empirical computational complexity
Sort
View
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 7 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
MIDDLEWARE
2007
Springer
16 years 1 months ago
Got predictability?: experiences with fault-tolerant middleware
Unpredictability in COTS-based systems often manifests as occasional instances of uncontrollably-high response times. A particular category of COTS systems, fault-tolerant (FT) mid...
Tudor Dumitras, Priya Narasimhan
194
Voted
WIOPT
2010
IEEE
15 years 5 months ago
Hub-betweenness analysis in delay tolerant networks inferred by real traces
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
Giuliano Grossi, Federico Pedersini
CVPR
1999
IEEE
16 years 9 months ago
An Efficient Recursive Factorization Method for Determining Structure from Motion
A recursive method is presented for recovering 3D object shape and camera motion under orthography from an extended sequence of video images. This may be viewed as a natural exten...
Yanhua Li, Michael J. Brooks
181
Voted
CCS
2007
ACM
16 years 1 months ago
Program obfuscation: a quantitative approach
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
Bertrand Anckaert, Matias Madou, Bjorn De Sutter, ...