Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,690,363 papers from all fields of science
Search
Sign In
Create Free Account
Selection algorithm
Known as:
Hoare's algorithm
, Select algorithm
, Selection problem
Expand
In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list or array; such a number is called the kth…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
42 relations
Algorithm
Amortized analysis
Array data structure
C++
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Efficient Multi-granularity Service Composition
Lina Barakat
,
S. Miles
,
I. Poernomo
,
Michael Luck
IEEE International Conference on Web Services
2011
Corpus ID: 14273686
Dynamic composition of services provides the ability to build complex distributed applications at run time by combining existing…
Expand
2010
2010
Multiaccess Radio Network Enviroments
D. Charilas
,
A. D. Panagopoulous
IEEE Vehicular Technology Magazine
2010
Corpus ID: 22577194
Nowadays there is a plethora of independent radio access technologies (RATs), each supporting distinct coverage, mobility, data…
Expand
2009
2009
TEXT EXTRACTION FROM STREET LEVEL IMAGES
Jonathan Fabrizio
,
M. Cord
,
B. Marcotegui
2009
Corpus ID: 17329781
We offer in this article, a method for text extraction in images issued from city scenes. This method is used in the French…
Expand
2009
2009
QoS ontology based efficient web services selection
Lili Qu
,
Yan Chen
International Conference on Management Science…
2009
Corpus ID: 12801845
The ability to efficiently and effectively select the inter-organizational and heterogeneous services is the important support…
Expand
2008
2008
Thomson Reuters at TAC 2008: Aggressive Filtering with FastSum for Update and Opinion Summarization
Frank Schilder
,
R. Kondadadi
,
Jochen L. Leidner
,
Jack G. Conrad
Text Analysis Conference
2008
Corpus ID: 17255728
In TAC 2008 we participated in the main task (Update Summarization) as well as the Sentiment Summarization pilot task. We…
Expand
2007
2007
Solving the Satisfiability Problem Using Finite Learning Automata
Ole-Christoffer Granmo
,
N. Bouhmala
International Journal of Computer Science and…
2007
Corpus ID: 17917274
A large number of problems that occur in knowledge -representation, learning, VLSI-design, and other areas of artificial…
Expand
2006
2006
Fast Quality Driven Selection of Composite Web Services
Jae-Ho Jang
,
Donghoon Shin
,
Kyong-Ho Lee
IEEE European Conference on Web Services
2006
Corpus ID: 9047071
The composite Web service selection is the process of building an executable composite Web service. Generally, the selection…
Expand
Highly Cited
2003
Highly Cited
2003
MIRAI: a solution to seamless access in heterogeneous wireless networks
M. Inoue
,
K. Mahmud
,
H. Murakami
,
M. Hasegawa
IEEE International Conference on Communications…
2003
Corpus ID: 16516038
A key word describing next-generation wireless communications, so called 4G, is "seamless". As part of the e-Japan plan promoted…
Expand
1993
1993
On the check base selection problem for fast adders
U. Sparmann
Digest of Papers Eleventh Annual IEEE VLSI Test…
1993
Corpus ID: 28810084
Considers the problem of selecting a suitable check base for on-line error detection by residue codes in fast adders. The…
Expand
1982
1982
A Selection Model for Systems Development Tools
J. D. Naumann
,
S. Palvia
MIS Q.
1982
Corpus ID: 20724031
Selecting from the many currently available systems development methodologies (SDMs) and development techniques is a difficult…
Expand