Sciweavers

1985 search results - page 352 / 397
» A Minimal Periods Algorithm with Applications
Sort
View
103
Voted
GECCO
2004
Springer
123views Optimization» more  GECCO 2004»
15 years 6 months ago
Heuristic Methods for Solving Euclidean Non-uniform Steiner Tree Problems
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
Ian Frommer, Bruce L. Golden, Guruprasad Pundoor
106
Voted
SIGGRAPH
1998
ACM
15 years 4 months ago
Non-distorted Texture Mapping for Sheared Triangulated Meshes
This article introduces new techniques for non-distorted texture mapping on complex triangulated meshes. Texture coordinates are assigned to the vertices of the triangulation by u...
Bruno Lévy, Jean-Laurent Mallet
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
16 years 1 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 1 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 23 days ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...