Sciweavers

4037 search results - page 40 / 808
» Routing without ordering
Sort
View
WSC
2008
13 years 10 months ago
Optimizing staffing schedule in light of patient satisfaction for the whole outpatient hospital ward
The waiting time for patients in outpatient departments of hospitals is a problem throughout the world. In this context, a discrete-event-simulation model was developed to examine...
Soemon Takakuwa, Athula Wijewickrama
PERCOM
2005
ACM
14 years 7 months ago
Routing Layer Support for Service Discovery in Mobile Ad Hoc Networks
Service discovery in Mobile Ad Hoc Networks is an essential process in order for these networks to be selfconfigurable. In this paper we argue that Service Discovery can be greatl...
Christopher N. Ververidis, George C. Polyzos
ICIP
2006
IEEE
14 years 9 months ago
Lucas-Kanade without Iterative Warping
Many methods for motion computation and object tracking are based on the Lucas-Kanade (LK) framework [1]. We present a method which substantially speeds up the LK approach while p...
Alex Rav-Acha, Shmuel Peleg
ICIP
2001
IEEE
14 years 9 months ago
Faster template matching without FFT
We consider the template matching problem, in which one wants to find all good enough occurrences of a pattern template P from a larger image I. The current standard of template m...
Kimmo Fredriksson, Esko Ukkonen
ECIR
2009
Springer
14 years 4 months ago
Using Multiple Query Aspects to Build Test Collections without Human Relevance Judgments
Abstract. Collecting relevance judgments (qrels) is an especially challenging part of building an information retrieval test collection. This paper presents a novel method for crea...
Miles Efron