Sciweavers

868 search results - page 47 / 174
» A general compression algorithm that supports fast searching
Sort
View
IPPS
2003
IEEE
14 years 1 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
CF
2004
ACM
14 years 1 months ago
An information-interconnectivity-based retrieval method for network attached storage
Network attached disk storage is characterized by independent network attachment and embedded intelligence. For Internet applications, it provides the key functionality of geograp...
Iliyak Georgiev, Ivo I. Georgiev
DOCENG
2008
ACM
13 years 9 months ago
Satisficing scrolls: a shortcut to satisfactory layout
We present at a new approach to finding aesthetically pleasing page layouts. We do not aim to find an optimal layout, rather the aim is to find a layout which is not obviously wro...
Nathan Hurst, Kim Marriott
MP
2006
137views more  MP 2006»
13 years 7 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
ECML
1998
Springer
13 years 12 months ago
A Monotonic Measure for Optimal Feature Selection
Feature selection is a problem of choosing a subset of relevant features. Researchers have been searching for optimal feature selection methods. `Branch and Bound' and Focus a...
Huan Liu, Hiroshi Motoda, Manoranjan Dash