Sciweavers

2778 search results - page 56 / 556
» Limit complexities revisited
Sort
View
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
15 years 1 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
DEBS
2008
ACM
15 years 1 months ago
Relative temporal constraints in the Rete algorithm for complex event detection
Complex Event Processing is an important technology for information systems with a broad application space ranging from supply chain management, systems monitoring, and stock mark...
Karen Walzer, Tino Breddin, Matthias Groch
ICDM
2003
IEEE
123views Data Mining» more  ICDM 2003»
15 years 5 months ago
Complex Spatial Relationships
This paper describes the need for mining complex relationships in spatial data. Complex relationships are defined as those involving two or more of: multi-feature co-location, sel...
Robert Munro, Sanjay Chawla, Pei Sun
ICIP
2004
IEEE
16 years 1 months ago
Scalable video coding based on motion-compensated temporal filtering: complexity and functionality analysis
Video coding techniques yielding state-of-the-art compression performance require large amount of computational resources, hence practical implementations, which target a broad ma...
Fabio Verdicchio, Yiannis Andreopoulos, Tom Clerck...
IJCAI
2003
15 years 1 months ago
Definition and Complexity of Some Basic Metareasoning Problems
In most real-world settings, due to limited time or other resources, an agent cannot perform all potentially useful deliberation and information gathering actions. This leads to t...
Vincent Conitzer, Tuomas Sandholm