Sciweavers

2745 search results - page 438 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
159
Voted
TCSV
2008
150views more  TCSV 2008»
15 years 4 months ago
Mining Recurring Events Through Forest Growing
Recurring events are short temporal patterns that consist of multiple instances in the target database. Without any a priori knowledge of the recurring events, in terms of their le...
Junsong Yuan, Jingjing Meng, Ying Wu, Jiebo Luo
160
Voted
IPSN
2011
Springer
14 years 8 months ago
Sensor networks for the detection and tracking of radiation and other threats in cities
This paper presents results from experiments, mathematical analysis, and simulations of a network of static and mobile sensors for detecting threats on city streets and in open ar...
Annie H. Liu, Julian J. Bunn, K. Mani Chandy
CVPR
2004
IEEE
16 years 6 months ago
Integrating Multiple Model Views for Object Recognition
We present a new approach to appearance-based object recognition, which captures the relationships between multiple model views and exploits them to improve recognition performanc...
Vittorio Ferrari, Tinne Tuytelaars, Luc J. Van Goo...
CVPR
2005
IEEE
16 years 6 months ago
Correspondence Expansion for Wide Baseline Stereo
We present a new method for generating large numbers of accurate point correspondences between two wide baseline images. This is important for structure-from-motion algorithms, wh...
Kevin L. Steele, Parris K. Egbert