Sciweavers

2969 search results - page 176 / 594
» A space efficient algorithm for group structure computation
Sort
View
98
Voted
AIPS
2003
15 years 5 months ago
Planning for Marketing Campaigns
In business marketing, corporations and institutions are interested in executing a sequence of marketing actions to affect a group of customers. For example, a financial instituti...
Qiang Yang, Hong Cheng
128
Voted
TSMC
2002
110views more  TSMC 2002»
15 years 3 months ago
Complexity reduction for "large image" processing
We present a method for sampling feature vectors in large (e.g., 2000 5000 16 bit) images that finds subsets of pixel locations which represent "regions" in the image. Sa...
Nikhil R. Pal, James C. Bezdek
149
Voted
ICDE
2007
IEEE
131views Database» more  ICDE 2007»
15 years 10 months ago
Incremental Clustering of Mobile Objects
Moving objects are becoming increasingly attractive to the data mining community due to continuous advances in technologies like GPS, mobile computers, and wireless communication ...
Sigal Elnekave, Mark Last, Oded Maimon
147
Voted
ICWN
2008
15 years 5 months ago
Progressive Content-Sensitive Data Retrieval in Sensor Networks
: Problem statement: For a sensor network comprising autonomous and self-organizing data sources, efficient similarity-based search for semantic-rich resources (such as video data)...
Bo Yang, Mareboyana Manohar, Shaoying Kou
133
Voted
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
15 years 9 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz