Sciweavers

235 search results - page 43 / 47
» An empirical study into class testability
Sort
View
96
Voted
SOFSEM
2000
Springer
15 years 1 months ago
Exhaustive Search, Combinatorial Optimization and Enumeration: Exploring the Potential of Raw Computing Power
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
Jürg Nievergelt
BMCBI
2006
150views more  BMCBI 2006»
14 years 9 months ago
Predicting protein subcellular locations using hierarchical ensemble of Bayesian classifiers based on Markov chains
Background: The subcellular location of a protein is closely related to its function. It would be worthwhile to develop a method to predict the subcellular location for a given pr...
Alla Bulashevska, Roland Eils
GIS
2002
ACM
14 years 9 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
SIGMOD
2004
ACM
198views Database» more  SIGMOD 2004»
15 years 9 months ago
Secure XML Querying with Security Views
The prevalent use of XML highlights the need for a generic, flexible access-control mechanism for XML documents that supports efficient and secure query access, without revealing ...
Wenfei Fan, Chee Yong Chan, Minos N. Garofalakis
CORR
2010
Springer
156views Education» more  CORR 2010»
14 years 9 months ago
On the bias of BFS
Abstract--Breadth First Search (BFS) and other graph traversal techniques are widely used for measuring large unknown graphs, such as online social networks. It has been empiricall...
Maciej Kurant, Athina Markopoulou, Patrick Thiran