Sciweavers

7303 search results - page 19 / 1461
» Optimality for dynamic patterns
Sort
View
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
14 years 23 days ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen
HPCA
2004
IEEE
14 years 9 months ago
Creating Converged Trace Schedules Using String Matching
This paper focuses on generating efficient software pipelined schedules for in-order machines, which we call Converged Trace Schedules. For a candidate loop, we form a string of t...
Satish Narayanasamy, Yuanfang Hu, Suleyman Sair, B...
ECCV
2006
Springer
14 years 10 months ago
Accelerated Convergence Using Dynamic Mean Shift
Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this pa...
Kai Zhang, James T. Kwok, Ming Tang
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
14 years 3 months ago
Dynamic vs. Oblivious Routing in Network Design
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...
Navin Goyal, Neil Olver, F. Bruce Shepherd
GECCO
2004
Springer
102views Optimization» more  GECCO 2004»
14 years 1 months ago
Dynamic and Scalable Evolutionary Data Mining: An Approach Based on a Self-Adaptive Multiple Expression Mechanism
Data mining has recently attracted attention as a set of efficient techniques that can discover patterns from huge data. More recent advancements in collecting massive evolving da...
Olfa Nasraoui, Carlos Rojas, Cesar Cardona