Sciweavers

4112 search results - page 320 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
ICTAI
2008
IEEE
16 years 1 months ago
FIP: A Fast Planning-Graph-Based Iterative Planner
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
Jicheng Fu, Farokh B. Bastani, Vincent Ng, I-Ling ...
IPPS
1999
IEEE
15 years 11 months ago
Mapping Media Streams onto a Network of Servers
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
Reinhard Lüling
CVPR
2003
IEEE
16 years 8 months ago
Mean-shift Blob Tracking through Scale Space
The mean-shift algorithm is an efficient technique for tracking 2D blobs through an image. Although the scale of the mean-shift kernel is a crucial parameter, there is presently n...
Robert T. Collins
ICDE
1995
IEEE
112views Database» more  ICDE 1995»
16 years 8 months ago
Optimizing Queries with Materialized Views
While much work has addressed the problem of maintaining materialized views, the important question of optimizing queries in the presence of materialized views has not been resolv...
Surajit Chaudhuri, Ravi Krishnamurthy, Spyros Pota...
DAWAK
2010
Springer
15 years 4 months ago
Mining Non-redundant Information-Theoretic Dependencies between Itemsets
Abstract. We present an information-theoretic framework for mining dependencies between itemsets in binary data. The problem of closure-based redundancy in this context is theoreti...
Michael Mampaey