Sciweavers

794 search results - page 35 / 159
» Improved algorithms for orienteering and related problems
Sort
View
IPM
2007
158views more  IPM 2007»
13 years 10 months ago
Validation and interpretation of Web users' sessions clusters
Understanding users’ navigation on the Web is important towards improving the quality of information and the speed of accessing large-scale Web data sources. Clustering of users...
George Pallis, Lefteris Angelis, Athena Vakali
TIP
2010
115views more  TIP 2010»
13 years 4 months ago
Constrained and Dimensionality-Independent Path Openings
Abstract--Path openings and closings are morphological operations with flexible line segments as structuring elements. These line segments have the ability to adapt to local image ...
Cris L. Luengo Hendriks
TACAS
2010
Springer
167views Algorithms» more  TACAS 2010»
14 years 5 months ago
Antichain Algorithms for Finite Automata
Abstract. We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability...
Laurent Doyen, Jean-François Raskin
ICDE
2006
IEEE
158views Database» more  ICDE 2006»
14 years 11 months ago
Space-efficient Relative Error Order Sketch over Data Streams
We consider the problem of continuously maintaining order sketches over data streams with a relative rank error guarantee . Novel space-efficient and one-scan randomised technique...
Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wa...
WECWIS
2006
IEEE
78views ECommerce» more  WECWIS 2006»
14 years 4 months ago
Improving Patient Activity Schedules by Multi-agent Pareto Appointment Exchanging
We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects t...
Ivan B. Vermeulen, Sander M. Bohte, D. J. A. Somef...