Sciweavers

475 search results - page 23 / 95
» Efficient Set Similarity Joins Using Min-prefixes
Sort
View
ICTAI
2000
IEEE
15 years 10 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 6 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
295
Voted
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
15 years 8 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
QUESTA
2006
101views more  QUESTA 2006»
15 years 6 months ago
Insensitive versus efficient dynamic load balancing in networks without blocking
So-called Whittle networks have recently been shown to give tight approximations for the performance of non-locally balanced networks with blocking, including practical routing pol...
Matthieu Jonckheere
168
Voted
ISBI
2007
IEEE
16 years 26 days ago
Head and Neck Cancer Patient Similarity Based on Anatomical Structural Geometry
As we develop radiation treatment planning systems for head and neck cancer patients, there is a need to identify reference patients whose anatomical structures share similar feat...
Chia-Chi Teng, Linda G. Shapiro, Ira J. Kalet, Car...