Sciweavers

2880 search results - page 162 / 576
» Approximate Range Searching
Sort
View
103
Voted
CEC
2007
IEEE
15 years 10 months ago
A cost benefit operator for efficient multi level genetic algorithm searches
— In this paper we present a novel cost benefit operator that assists multi level genetic algorithm searches. Through the use of the cost benefit operator, it is possible to dyna...
George G. Mitchell, Barry McMullin, James Decraene
139
Voted
ACIVS
2005
Springer
15 years 9 months ago
Reduced-Bit, Full Search Block-Matching Algorithms and Their Hardware Realizations
Abstract. The Full Search Block-Matching Motion Estimation (FSBME) algorithm is often employed in video coding for its regular dataflow and straightforward architectures. By iterat...
Vincent M. Dwyer, Shahrukh Agha, Vassilios A. Chou...
122
Voted
COMPGEOM
2001
ACM
15 years 7 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
134
Voted
IJEB
2006
77views more  IJEB 2006»
15 years 3 months ago
Refinery of an internet-based search tool: exploring perceptions from information systems practitioners
: In today's dynamic business environment, the capability to understand the needs and responses of stakeholders is critical, as such management can devise effective plans and ...
Michael Chau, Ivy Chan
148
Voted
WAIM
2010
Springer
15 years 1 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan