Sciweavers

1047 search results - page 29 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
PPSN
2010
Springer
13 years 6 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
WWW
2005
ACM
14 years 8 months ago
Improving Web search efficiency via a locality based static pruning method
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
Edleno Silva de Moura, Célia Francisca dos ...
CIKM
2006
Springer
13 years 9 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
TSMC
2008
133views more  TSMC 2008»
13 years 7 months ago
Trading With a Stock Chart Heuristic
Abstract--The efficient market hypothesis (EMH) is a cornerstone of financial economics. The EMH asserts that security prices fully reflect all available information and that the s...
William Leigh, Cheryl J. Frohlich, Steven Hornik, ...
ICIP
2000
IEEE
14 years 9 months ago
Efficient Video Similarity Measurement and Search
We consider the use of meta-data and/or video-domain methods to detect similar videos on the web. Meta-data is extracted from the textual and hyperlink information associated with...
Sen-Ching S. Cheung, Avideh Zakhor