Sciweavers

2313 search results - page 347 / 463
» On Heuristic Time Hierarchies
Sort
View
ADBIS
2009
Springer
143views Database» more  ADBIS 2009»
16 years 1 months ago
Cost-Based Vectorization of Instance-Based Integration Processes
The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiting times f...
Matthias Böhm, Dirk Habich, Steffen Preissler...
WEBI
2009
Springer
16 years 1 months ago
Fast Matching for All Pairs Similarity Search
All pairs similarity search is the problem of finding all pairs of records that have a similarity score above the specified threshold. Many real-world systems like search engine...
Amit C. Awekar, Nagiza F. Samatova
COSIT
2009
Springer
141views GIS» more  COSIT 2009»
16 years 1 months ago
A Conceptual Model of the Cognitive Processing of Environmental Distance Information
Abstract. I review theories and research on the cognitive processing of environmental distance information by humans, particularly that acquired via direct experience in the enviro...
Daniel R. Montello
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
16 years 1 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
16 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl